QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#717815#7897. Largest Digitfutarian#AC ✓34ms3944kbC++11489b2024-11-06 19:01:432024-11-06 19:01:44

Judging History

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

  • [2024-11-06 19:01:44]
  • 评测
  • 测评结果:AC
  • 用时:34ms
  • 内存:3944kb
  • [2024-11-06 19:01:43]
  • 提交

answer

#include "bits/stdc++.h"
using namespace std;
const int Len = 2e5 + 5;
int l,r,L,R;
inline int calc(int x)
{
	int ret = 0;
	while(x)
	{
		ret = max(ret , x % 10);
		x /= 10;
	}
	return ret;
}
signed main()
{
	int T;scanf("%d",&T);
	while(T --)
	{
		scanf("%d %d %d %d",&l,&r,&L,&R);
		int ret = 0;
		for(int i = l ; i <= min(l + 100 , r) ; i ++) 
			for(int j = L ; j <= min(L + 100 , R) ; j ++) ret = max(ret , calc(i + j));
		printf("%d\n",ret);
	}
	return 0;
}

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

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
178 182 83 85
2 5 3 6

output:

7
9

result:

ok 2 lines

Test #2:

score: 0
Accepted
time: 34ms
memory: 3944kb

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