QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #554298 | #7897. Largest Digit | liqingyang# | WA | 2ms | 3624kb | C++14 | 495b | 2024-09-09 10:05:23 | 2024-09-09 10:05:24 |
Judging History
answer
#include<iostream>
using namespace std;
int T,la,ra,lb,rb;
int main()
{
ios::sync_with_stdio(false);
cin.tie(0);
cin>>T;
while(T--)
{
cin>>la>>ra>>lb>>rb;
if(ra-la+1+rb-lb+1<10)
{
int Ans=0;
for(int i=la;i<=ra;i++)
{
for(int j=lb;j<=rb;j++)
{
int x=i+j,ans=0;
while(x)
{
ans=max(ans,x%10);
x/=10;
}
Ans=max(Ans,ans);
}
}
cout<<Ans<<endl;
continue;
}
cout<<9<<endl;
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3624kb
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: 3620kb
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 9 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:
wrong answer 59th lines differ - expected: '8', found: '9'