QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #302150 | #6300. Best Carry Player 2 | USTC_fish_touching_team# | WA | 64ms | 3868kb | C++17 | 1.0kb | 2024-01-10 16:54:14 | 2024-01-10 16:54:15 |
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);
if(k==0){
int c=0;
while(x%10==9)c++,x=x/10;
printf("1");
for(int i=1;i<=c;i++)printf("0");printf("\n");
continue;
}
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-1]!=0)pl--;
if(pr-pl+1>=res){
for(int i=pr;i>pr-res+1;i--)ans[i]=9-a[i];
ans[pr-res+1]=10-a[pr-res+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;
}
for(int i=ez;i>=1;i--)printf("%d",ans[i]);
for(int i=1;i<=cnt;i++)printf("0");
printf("\n");
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 3868kb
input:
4 12345678 0 12345678 5 12345678 18 990099 5
output:
1 54322 999999999987654322 9910
result:
ok 4 lines
Test #2:
score: 0
Accepted
time: 0ms
memory: 3752kb
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:
100000 10000 1000 100 10 1 900001 9900001 99900001 999900001 10000000001 9999910000 9999901000 9999900100 9999900010 9999900001 9000009999900001 99000009999900001 999000009999900001 99999999999999999900000000000000000 1000000000000000000
result:
ok 21 lines
Test #3:
score: -100
Wrong Answer
time: 64ms
memory: 3844kb
input:
100000 119111011091190000 10 1911011191011999 16 110099199000119 0 19009911191091011 13 199090909919000900 17 19009010011919110 5 90910190019900091 18 10911100000101111 1 110090011101119990 4 100909999119090000 12 90901119109011100 2 111010119991090101 4 900991019109199009 5 100919919990991119 8 911...
output:
88988908810000 8088988808988001 10 88808908989 9800909090080999100 80890 909089809980099909 9 80010 9090000880910000 8900 9909 991 9008900 8880880090 8080090801 8009900808909899 80880898981 909 8800909 99988889901 89908888089 980908890980099000 100 9889801 81 908890008099900891 880990801 9998099 890...
result:
wrong answer 44th lines differ - expected: '101', found: '100'