QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#180910 | #6300. Best Carry Player 2 | linzi# | WA | 0ms | 3956kb | C++17 | 811b | 2023-09-16 14:19:13 | 2023-09-16 14:19:14 |
Judging History
answer
#include<bits/stdc++.h>
#define ll long long
#define inf 1e18
#define mn 100005
using namespace std;
ll ans,n,m,a[35],b[35];
void cal(ll mi,ll ma)
{ll i;
b[mi]=10-a[mi];
for(i=mi+1;i<=ma;i++)
b[i]=9-a[i];
b[0]=ma;
}
int main()
{
ll t,x,y,z,i,j,k;
cin>>t;
while(t--)
{
scanf("%lld%lld",&n,&m);
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
x=n;
while(x)
{
a[++a[0]]=x%10;
x/=10;
}
if(m==0)
{
i=1;
while(a[i]==9)i++;
b[0]=i;
b[b[0]]=1;
}
else
{
i=1;
while(a[i]==0)i++;
x=i;
if(a[m+x]!=9)
{
cal(x,m+x-1);
}
else
{
i=m+x;
while(a[i]==9)i++;
cal(i-m,i-1);
}
}
while(b[b[0]]==0)b[0]--;
for(i=b[0];i>=1;i--)
printf("%lld",b[i]);
puts("");
}
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 0ms
memory: 3956kb
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: 0ms
memory: 3948kb
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 99991000000 9999910000 9999901000 9999900100 9999900010 9999900001 9000009999900001 99000009999900001 999000009999900001 -99999999999999999900000000000000000 1000000000000000000
result:
wrong answer 11th lines differ - expected: '10000000001', found: '99991000000'