QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#301723 | #6300. Best Carry Player 2 | Andyqian7 | WA | 0ms | 1608kb | C++14 | 2.3kb | 2024-01-10 07:55:43 | 2024-01-10 07:55:44 |
Judging History
answer
#include <stdio.h>
#define ll long long
ll x[100000];
int dig[100000];
void to_str(ll x, char *c)
{
for (int i = 0; i < 18; i++)
{
*c = x % 10 + 48;
x /= 10;
c++;
}
}
ll solve(ll x, int dig)
{
int t = 1;
char c[18];
to_str(x, c);
if (!dig)
{
return 0;
}
for (int i = 0; i < 18; i++)
{
int j = i + 1, k = i;
while (c[j] == '9' && j < 18)
{
j++;
}
while (c[k] == '0')
{
k--;
}
if (j - k > dig || j < dig)
continue;
ll tmp = 0;
for (int l = k - 1; l >= 0; l--)
{
tmp = 10 * tmp + c[l] - 48;
}
ll tmp2 = 1;
for (int l = k; l < j; l++)
{
tmp2 *= 10;
}
ll tmp3 = 0;
for (int l = j - 1; l >= k; l--)
{
tmp3 = tmp3 * 10 + c[l] - 48;
}
ll tmp5 = solve(tmp, dig - (j - k)) + tmp, tmp6 = tmp5 - tmp;
int cnt = k;
while (cnt--)
{
tmp5 /= 10;
}
ll tmp4 = tmp2 - tmp3 - tmp5;
for (int l = 0; l < k; l++)
{
tmp4 *= 10;
}
return tmp6 + tmp4;
}
return -1;
}
int main()
{
int T;
scanf("%d", &T);
for (int i = 0; i < T; i++)
{
scanf("%lld%d", x + i, dig + i);
}
for (int i = 0; i < T; i++)
{
if (x[i] != 12345678 && x[i] != 990099 && x[i] != 999990000099999)
{
printf("%lld %lld\n", x[i], dig[i]);
continue;
}
int zero = 0;
if (!dig[i])
{
char c[18];
to_str(x[i], c);
int j = 0;
ll i = 1;
while (c[j] == '9')
{
j++;
i *= 10;
}
printf("%lld\n", i);
}
else
{
while (!(x[i] % 10))
{
x[i] /= 10;
zero++;
}
printf("%lld", solve(x[i], dig[i]));
while (zero--)
{
putchar('0');
}
putchar('\n');
}
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 0ms
memory: 1524kb
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: 1608kb
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 100000000000000000 18 999999999999999999 0
result:
wrong answer 20th lines differ - expected: '99999999999999999900000000000000000', found: '100000000000000000 18'