QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#301738#7897. Largest Digitucup-team173#AC ✓1ms3456kbC++17890b2024-01-10 09:40:142024-01-10 09:40:15

Judging History

你现在查看的是最新测评结果

  • [2024-01-10 09:40:15]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3456kb
  • [2024-01-10 09:40:14]
  • 提交

answer

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define Mp make_pair
#define pb push_back

typedef double db;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;

void solve() {
    ll la, ra, lb, rb;
    cin >> la >> ra >> lb >> rb;
    if(ra - la + 1 >= 10 || rb - lb + 1 >= 10) {
        cout << "9\n";
    } else {
        ll ans = 0;
        auto f = [&](ll x) {
            ll res = 0;
            while(x) res = max(res, x % 10), x /= 10;
            return res;
        };
        for(ll a = la; a <= ra; a++)
            for(ll b = lb; b <= rb; b++) {
                ans = max(ans, f(a + b));
            }
        cout << ans << '\n';
    }
}
signed main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    int t = 1;
    cin >> t;
    while(t--) solve();
    return 0;
}

这程序好像有点Bug,我给组数据试试?

详细

Test #1:

score: 100
Accepted
time: 1ms
memory: 3336kb

input:

2
178 182 83 85
2 5 3 6

output:

7
9

result:

ok 2 lines

Test #2:

score: 0
Accepted
time: 1ms
memory: 3456kb

input:

1000
158260522 877914575 24979445 602436426
1 5 1101111 1101112
2 5 33333 33335
1 5 10111 10111
138996221 797829355 353195922 501899080
212 215 10302 10302
101100 101101 1 2
111 114 1101000 1101001
265804420 569328197 234828607 807497925
1110110 1110112 11100 11103
323 327 23 27
1 1 1 5
316412581 80...

output:

9
7
9
6
9
7
3
5
9
5
9
6
9
9
9
9
9
9
9
9
9
5
9
6
9
9
7
8
9
9
9
9
9
9
3
8
9
7
7
9
9
6
7
9
9
8
9
6
9
9
9
5
9
4
9
5
9
7
8
8
9
9
9
6
9
8
9
5
9
7
9
7
9
9
6
5
9
2
3
6
9
9
8
6
9
9
6
4
9
9
9
9
9
9
8
2
9
4
5
9
9
9
8
6
9
5
7
9
9
9
9
5
9
7
8
5
9
9
9
7
9
9
3
3
9
9
5
7
9
9
6
6
9
7
7
9
9
8
9
9
9
5
9
6
9
7
9
4
9
5
...

result:

ok 1000 lines

Extra Test:

score: 0
Extra Test Passed