QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#410096#7897. Largest Digithuangbrother#AC ✓2ms3664kbC++17608b2024-05-13 12:41:052024-05-13 12:41:06

Judging History

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

  • [2024-05-13 12:41:06]
  • 评测
  • 测评结果：AC
  • 用时：2ms
  • 内存：3664kb
查看
  • [2024-05-13 12:41:05]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
int main(){
    int t;
    cin>>t;
    while(t--){
        int la,ra,lb,rb;
        cin>>la>>ra>>lb>>rb;
        int maxx=0;int flag=0;
        for(int i=la;i<=ra;i++){
            for(int j=lb;j<=rb;j++){
                int res=i+j;
                flag=0;
                while(res){
                    if(res%10==9)flag=1;
                    
                    maxx=max(maxx,res%10);res/=10;
                }
                if(flag==1)break;
            }
            if(flag==1)break;
        }
        cout<<maxx<<endl;
    }
}
Source code, Language: C++17

这程序好像有点Bug，我给组数据试试？

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 3592kb

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
English 繁體中文 简体中文

Server Time: 2024-11-30 18:35:48 | OpenSource Project