QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#715178#7897. Largest DigitMLK#AC ✓1ms3640kbC++141.2kb2024-11-06 10:42:212024-11-06 10:42:23

Judging History

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

  • [2024-11-06 10:42:23]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3640kb
  • [2024-11-06 10:42:21]
  • 提交

answer

#include <bits/stdc++.h>
#define N (200000 + 10)  /*------------------ #define ------------------*/
#define M (400000 + 10)
#define MOD (1000000000 + 7)
//#define MOD (998244353)
#define INF (0x3f3f3f3f)
#define LNF (3e18)
#define mod(a,b) (((a)%(b)+(b))%(b))
#define IOS ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define fi first
#define se second
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
typedef pair<int,int> PII;
typedef pair<LL,LL> PLL;
typedef pair<int,LL> PIL;
typedef pair<LL,int> PLI;
typedef pair<double,double> PDD;

int la,ra,lb,rb;

auto solve(){
	
	cin >> la >> ra >> lb >> rb;
	
	auto f = [&](int x){
		int ans = 0;
		while(x){
			ans = max(ans,x % 10);
			x /= 10;
		}
		return ans;
	};
	
	int L1 = (ra - la + 1),L2 = (rb - lb + 1);
	if(L1 >= 10 || L2 >= 10){
		cout << "9\n";
	}else{
		int ans = 0;
		for(int i = la;i <= ra;i ++ )
			for(int j = lb;j <= rb;j ++ )
				ans = max(ans,f(i + j));
		cout << ans << '\n';
	}
	
}

signed main(){
	IOS
	int T = 1;
	//
	cin >> T;
	while(T -- ) solve();
	//while(T -- ) cout << (solve() ? "YES" : "NO") << '\n';

    return 0;
}

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

详细

Test #1:

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

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

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