QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#299856#7897. Largest DigitLoging#AC ✓0ms1604kbC++20441b2024-01-07 12:12:132024-01-07 12:12:13

Judging History

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

  • [2024-01-07 12:12:13]
  • 评测
  • 测评结果：AC
  • 用时：0ms
  • 内存：1604kb
查看
  • [2024-01-07 12:12:13]
  • 提交

answer

#include<cstdio>
#include<algorithm>
using namespace std;
int Get_val(int x){
	int res=0;
	while(x){
		res=max(res,x%10);
		x/=10;
	}
	return res;
}
int main(){
	int T;
	scanf("%d",&T);
	while(T--){
		int L1,R1,L2,R2;
		scanf("%d%d%d%d",&L1,&R1,&L2,&R2);
		int L=L1+L2,R=R1+R2;
		if(R-L>12)puts("9");
		else {
			int ans=0;
			for(int i=L;i<=R;i++)ans=max(ans,Get_val(i));
			printf("%d\n",ans);
		}
	}
	return 0;
}
Source code, Language: C++20

这程序好像有点Bug，我给组数据试试？

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
178 182 83 85
2 5 3 6

output:

7
9

result:

ok 2 lines

Test #2:

score: 0
Accepted
time: 0ms
memory: 1604kb

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
English 繁體中文 简体中文

Server Time: 2024-12-02 14:28:06 | OpenSource Project