QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#383414 | #7897. Largest Digit | gingoo# | AC ✓ | 1ms | 3604kb | C++20 | 929b | 2024-04-09 13:44:46 | 2024-04-09 13:44:47 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define PI pair<int,int>
bool cmp(PI a,PI b){
if(a.first==b.first)return a.second>b.second;
else return a.first<b.first;
}
const int inf=1e9;
string ch="edocteel";
int dp[2020];
struct node{
int x,y,gcd;
};
int gcdd(int x,int y){
if(!y)return x;
else return gcdd(y,x%y);
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int t;
cin>>t;
while(t--){
int la,ra,lb,rb;
cin>>la>>ra>>lb>>rb;
la+=lb;
ra+=rb;
if(ra-la>10)cout<<9<<"\n";
else{
int maxx=0;
for(int i=la;i<=ra;i++){
int tmp=i;
while(tmp){
maxx=max(tmp%10,maxx);
tmp/=10;
}
}
cout<<maxx<<'\n';
}
}
return 0;
}
这程序好像有点Bug,我给组数据试试?
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3604kb
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: 3584kb
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