QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #543114 | #7897. Largest Digit | New_Folder# | WA | 1ms | 3680kb | C++14 | 596b | 2024-09-01 13:54:28 | 2024-09-01 13:54:28 |
Judging History
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 cout<<b%10<<"\n";
}
}
signed main(){
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int t;cin>>t;while(t--)
solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3508kb
input:
2 178 182 83 85 2 5 3 6
output:
7 9
result:
ok 2 lines
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3680kb
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'