QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#346534 | #7897. Largest Digit | Freeuni1# | AC ✓ | 2ms | 3660kb | C++14 | 826b | 2024-03-08 17:20:11 | 2024-03-08 17:20:11 |
Judging History
answer
#include<bits/stdc++.h>
#define int long long
using namespace std;
const int N = 1e6 + 5;
const int mod = 1e9 + 7;
const int MAX_VAL = 1e15+5;
int n, m, k, l, i, j, a, b, r, x, y;
int d[N], sum[N];
int pr[N];
int res, tot, ans;
int get(int n){
int ret=0;
while(n>0){
ret=max(ret, n%10);
n/=10;
}
return ret;
}
void solve(){
cin>>l>>r>>a>>b;
int res =0;
if(r-l+b-a+1 >= 10){
cout<<9<<endl;
return;
} else {
for(int i=l;i<=r;i++){
for(int j=a;j<=b;j++){
res=max(res, get(i+j));
}
}
}
cout<<res<<endl;
}
signed main(){
ios_base::sync_with_stdio(0);
cin.tie(nullptr);
int t=1;
cin>>t;
while(t--){
solve();
}
}
这程序好像有点Bug,我给组数据试试?
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3596kb
input:
2 178 182 83 85 2 5 3 6
output:
7 9
result:
ok 2 lines
Test #2:
score: 0
Accepted
time: 2ms
memory: 3660kb
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