QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#543122#7897. Largest DigitNew_Folder#AC ✓1ms3612kbC++14666b2024-09-01 14:00:142024-09-01 14:00:15

Judging History

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

  • [2024-09-01 14:00:15]
  • 评测
  • 测评结果:AC
  • 用时:1ms
  • 内存:3612kb
  • [2024-09-01 14:00:14]
  • 提交

answer

#pragma GCC optimize(2)
#include <bits/stdc++.h>
#define int long long
//#define pi 3.1415926
typedef long long ll;
using namespace std;
int mod=998244353;

int fp(int a,int b){
	int ans=1;
	while(b){
		if(b&1) ans*=a,ans%=mod;
		a*=a,a%=mod;
		b>>=1;
	}
	return ans;
}

void solve(){
	int la,ra,lb,rb;cin>>la>>ra>>lb>>rb;
	int a=la+lb,b=ra+rb;
	if(b-a>=10)	cout<<9<<"\n";
	else{
		if(a/10!=b/10) cout<<9<<"\n";
		else{
			int maxi=0;
			while(b!=0) maxi=max(maxi,b%10),b/=10;
			cout<<maxi<<"\n";
		} 
	}
}

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

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

詳細信息

Test #1:

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

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

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