QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#300635 | #7897. Largest Digit | ydzr00000 | AC ✓ | 1ms | 3688kb | C++20 | 545b | 2024-01-08 15:31:47 | 2024-01-08 15:31:48 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
inline void solve()
{
int la,ra,lb,rb;
scanf("%d %d %d %d",&la,&ra,&lb,&rb);
if(ra-la+1>10||rb-lb+1>10)
{
puts("9");
return;
}
int ans=0;
auto MaxDigit=[&](int x)->int
{
int num=0;
while(x)
{
num=max(num,x%10);
x/=10;
}
return num;
};
for(int x=la;x<=ra;x++)
for(int y=lb;y<=rb;y++)
{
int s=x+y;
ans=max(ans,MaxDigit(s));
}
printf("%d\n",ans);
}
int main(){
int t;
scanf("%d",&t);
while(t--)
solve();
return 0;
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3688kb
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: 3624kb
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