QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#631669 | #7897. Largest Digit | Pepinot | AC ✓ | 0ms | 3708kb | C++20 | 506b | 2024-10-12 09:33:34 | 2024-10-12 09:33:34 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define pii pair<int,int>
char gett(int x){
string s=to_string(x);
sort(s.begin(),s.end());
return s.back();
}
void solve(){
int a,b,c,d;
cin>>a>>b>>c>>d;
int x=a+c,y=b+d;
char maxx='0';
for(int i=x; i<=min(y,x+10); i++){
maxx=max(maxx,gett(i));
}
cout<<maxx<<endl;
}
signed main() {
ios::sync_with_stdio(false),cin.tie(nullptr);
int t; cin>>t;
while(t--)
solve();
}
这程序好像有点Bug,我给组数据试试?
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3588kb
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: 3708kb
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