QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#346533#7897. Largest DigitFreeuni1#WA 2ms3672kbC++14809b2024-03-08 17:19:412024-03-08 17:19:42

Judging History

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

  • [2024-03-08 17:19:42]
  • 评测
  • 测评结果:WA
  • 用时:2ms
  • 内存:3672kb
  • [2024-03-08 17:19:41]
  • 提交

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;
    } 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();
    }

}

详细

Test #1:

score: 100
Accepted
time: 0ms
memory: 3672kb

input:

2
178 182 83 85
2 5 3 6

output:

7
9

result:

ok 2 lines

Test #2:

score: -100
Wrong Answer
time: 2ms
memory: 3608kb

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
0
7
9
6
9
0
7
3
5
9
0
5
9
6
9
0
9
9
9
9
0
9
9
0
9
9
0
5
9
0
6
9
0
9
7
8
9
0
9
9
0
9
9
0
9
3
8
9
0
7
7
9
9
0
6
7
9
9
0
8
9
6
9
0
9
9
0
5
9
0
4
9
5
9
0
7
8
8
9
0
9
9
6
9
0
8
9
5
9
0
7
9
0
7
9
0
9
6
5
9
0
2
3
6
9
0
9
8
6
9
0
9
6
4
9
0
9
9
0
9
9
0
9
8
2
9
0
4
5
9
0
9
0
9
8
6
9
0
5
7
9
9
0
9
9
5
9
0
7
...

result:

wrong answer 2nd lines differ - expected: '7', found: '0'