QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #302110 | #6300. Best Carry Player 2 | USTC_fish_touching_team# | WA | 1ms | 3884kb | C++17 | 952b | 2024-01-10 16:32:48 | 2024-01-10 16:32:48 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int a[100],ans[100];
int T;
int main(){
cin>>T;
while(T--){
long long x;
int k;
scanf("%lld%d",&x,&k);
int cnt=0;
while(x%10==0)x/=10,cnt++;
int len=0;
while(x>0){
a[++len]=x%10;x/=10;
}
for(int i=len+1;i<=50;i++)a[i]=0;
for(int i=1;i<=50;i++)ans[i]=-1;
int res=k;
while(res>0){
int pr=res,pl=res;
while(a[pr+1]==9)pr++;
while(a[pl]!=0)pl--;pl++;
if(pr-pl+1>=res){
for(int i=pr;i>pr-k+1;i--)ans[i]=9-a[i];
ans[pr-k+1]=10-a[pr-k+1];
break;
}
else {
int wl=pr-res+1;
while(a[wl]==0)wl++;
for(int i=pr;i>wl;i--)ans[i]=9-a[i];
ans[wl]=10-a[wl];
res-=pr-wl+1;
}
}
int ez=0;
for(int i=1;i<=50;i++){
if(ans[i]==-1)ans[i]=0;
if(ans[i]!=0)ez=i;
}
if(ez==0)printf("1");
for(int i=ez;i>=1;i--)printf("%d",ans[i]);
for(int i=1;i<=cnt;i++)printf("0");
printf("\n");
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 1ms
memory: 3864kb
input:
4 12345678 0 12345678 5 12345678 18 990099 5
output:
1 54322 999999999987654322 9910
result:
ok 4 lines
Test #2:
score: -100
Wrong Answer
time: 1ms
memory: 3884kb
input:
21 999990000099999 0 999990000099999 1 999990000099999 2 999990000099999 3 999990000099999 4 999990000099999 5 999990000099999 6 999990000099999 7 999990000099999 8 999990000099999 9 999990000099999 10 999990000099999 11 999990000099999 12 999990000099999 13 999990000099999 14 999990000099999 15 999...
output:
1 10000 1000 100 10 1 900001 9900001 99900001 999900001 10000000000 9999910000 9999901000 9999900100 9999900010 9999900001 9000009999900001 99000009999900001 999000009999900001 99999999999999999900000000000000000 1
result:
wrong answer 1st lines differ - expected: '100000', found: '1'