QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#277241 | #7897. Largest Digit | Messywind | AC ✓ | 1ms | 3616kb | C++17 | 805b | 2023-12-06 16:55:21 | 2023-12-06 16:55:22 |
Judging History
answer
#include <bits/stdc++.h>
#define tests
#define int long long
const int N = 1e5 + 10;
using namespace std;
using LL = long long;
int f(int a) {
int mx = 0;
while(a) {
mx = max(mx, a % 10);
a /= 10;
}
return mx;
}
void solve() {
int la, ra, lb, rb;
cin >> la >> ra >> lb >> rb;
if(ra - la >= 15 || rb - lb >= 15) cout << 9 << '\n';
else {
int ans = 0;
for(int i = la; i <= ra; i++) {
for(int j = lb; j <= rb; j++){
ans = max(ans, f(i + j));
}
}
cout << ans << '\n';
}
}
signed main() {
cin.tie(0)->ios::sync_with_stdio(0);
cout.tie(0);
int t = 1;
#ifdef tests
cin >> t;
#endif
for(int _ = 1; _ <= t; _ ++) solve();
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3548kb
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: 3616kb
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