QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #403332 | #7897. Largest Digit | ucup-team3282# | WA | 2ms | 3708kb | C++20 | 381b | 2024-05-02 08:51:27 | 2024-05-02 08:51:28 |
Judging History
answer
#include<iostream>
#include<cstring>
#include<algorithm>
#include<cstdio>
using namespace std;
int main(){
int t;cin>>t;while(t--){
long long x1,x2,y1,y2,x,y;
cin>>x1>>x2>>y1>>y2;
x=x1+y1;y=x2+y2;
if(y-x>=10)cout<<9<<endl;
else{
if(y%10<x%10)cout<<9<<endl;
else cout<<y%10<<endl;
}
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3708kb
input:
2 178 182 83 85 2 5 3 6
output:
7 9
result:
ok 2 lines
Test #2:
score: -100
Wrong Answer
time: 2ms
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 7 9 7 7 9 9 6 5 9 9 6 9 6 9 9 9 5 9 4 6 5 9 7 8 8 9 9 9 6 9 8 9 5 9 7 9 7 9 9 6 5 9 1 3 6 9 5 8 6 9 9 2 4 9 9 9 9 9 9 5 2 9 4 5 9 9 9 8 6 9 5 7 9 9 5 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 8 9 5 8 6 9 7 9 3 9 5 ...
result:
wrong answer 36th lines differ - expected: '8', found: '7'