QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#275240 | #7897. Largest Digit | John_zyj | AC ✓ | 1ms | 3512kb | C++20 | 809b | 2023-12-04 15:29:18 | 2023-12-04 15:29:18 |
Judging History
answer
#include<bits/stdc++.h>
#define LL long long
#define len(G) (LL)(G).size()
using namespace std;
LL la,ra,lb,rb;
template<typename T>
inline void read(T &x)
{
x=0;int w=1;char c=getchar();
while(!isdigit(c)){if(c=='-')w=-1; c=getchar();}
while(isdigit(c)){x=x*10+(c-'0'); c=getchar();}
if(w==-1) x=-x;
}
template<typename T,typename ...Args>
inline void read(T &x,Args &...args)
{
read(x),read(args...);
}
LL f(LL x)
{
LL ans=0;
while(x)
{
ans=max(ans,x%10);
x/=10;
}
return ans;
}
void solve()
{
read(la,ra,lb,rb);
if(ra-la+1>=10||rb-lb+1>=10)
{
puts("9");
return;
}
LL ans=0;
for(LL i=la;i<=ra;++i)
for(LL j=lb;j<=rb;++j)
ans=max(ans,f(i+j));
printf("%lld\n",ans);
}
int main()
{
LL T;
read(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: 3500kb
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: 3512kb
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