QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#556796#7897. Largest DigitsmlAC ✓2ms3708kbC++17563b2024-09-10 21:03:062024-09-10 21:03:12

Judging History

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

  • [2024-09-10 21:03:12]
  • 评测
  • 测评结果:AC
  • 用时:2ms
  • 内存:3708kb
  • [2024-09-10 21:03:06]
  • 提交

answer

#include<bits/stdc++.h>
#define int long long
using namespace std;
void solve()
{
    int l1,r1,l2,r2;
   cin>>l1>>r1>>l2>>r2;
   auto check=[&](int x){
   	  int mx=0;
   	  while(x){
   	  	  mx=max(mx,x%10);
   	  	  x/=10;
		}
		return mx;
   };
   int ans=0;
   for(int i=l1;i<=min(l1+20,r1);i++){
   	 for(int j=l2;j<=min(l2+20,r2);j++){
   	 	   ans=max(ans,check(i+j));
		}
   }
   cout<<ans<<'\n';
}
signed main()
{
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int t;
	cin>>t;
	while(t--) solve();
	return 0;
}

这程序好像有点Bug,我给组数据试试?

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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

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