QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#663692#7897. Largest Digitzyq_313#WA 1ms3616kbC++14741b2024-10-21 16:46:372024-10-21 16:46:37

Judging History

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

  • [2024-10-21 16:46:37]
  • 评测
  • 测评结果:WA
  • 用时:1ms
  • 内存:3616kb
  • [2024-10-21 16:46:37]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;

#define endl '\n'

void solve(){
	int l1, r1, l2, r2;
	cin >> l1 >> r1 >> l2 >> r2;
	// int L1 = l1.back() - '0', R1 = r1.back() - '0', L2 = l2.back() - '0', R2 = r2.back() - '0';
	int ans = 0;
	while (l1 || r1 || l2 || r2){
		int x1 = l1 % 10, y1 = r1 % 10, x2 = l2 % 10, y2 = r2 % 10;
	
		if (y1 < x1 ) y1 += 10;
		if (y2 < x2) y2 += 10;
		for (int i = x1; i <= y1; i ++){
			for (int j = x2; j <= y2; j ++){
				ans = max(ans, (i + j) % 10);
			}
		}
		l1 /= 10, l2 /= 10, r1 /= 10, r2 /= 10;
		
	}
	
	
	cout << ans << endl;
	
	
	
}


int main(){
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	
	int t = 1;
	cin >> t;
	while (t --) solve();
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

input:

2
178 182 83 85
2 5 3 6

output:

7
9

result:

ok 2 lines

Test #2:

score: -100
Wrong Answer
time: 1ms
memory: 3568kb

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
9
9
7
7
9
9
6
9
9
9
8
9
6
9
9
9
5
9
4
8
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
9
2
9
4
5
9
9
9
8
6
9
5
7
9
9
8
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
7
9
9
9
5
9
6
9
7
9
4
9
5
...

result:

wrong answer 36th lines differ - expected: '8', found: '9'