QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#296235 | #6300. Best Carry Player 2 | SaladDays# | WA | 0ms | 3492kb | C++14 | 1.7kb | 2024-01-02 15:28:47 | 2024-01-02 15:28:47 |
Judging History
answer
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ll pw[19];
void solve() {
ll x;int k;
cin >> x;
cin >> k;
vector<int>num_base(40, 0);
cout << x << endl;
for (int i = 0; i <= 18; i ++ ) num_base[i] = (x / pw[i]) % 10;
// for (auto &it : num_base) cout << it << ' ';cout << endl;
if (k == 0) {
for (int j = 0; j <= 19; ++j) {
if (num_base[j] != 9) {
cout << 1;
for (int i = 0; i < j; ++i) cout << 0;cout << endl;
return;
}
}
}
for (int i = 0; i <= 20; ++i) {
int cnt = 0, pos = i;
vector<int>ans(40);
vector<int>num = num_base;
while (cnt < k) {
if (num[pos] == 0) {
pos++;continue;
}
ans[pos] = 10 - num[pos];
num[pos + 1]++;
cnt++;
pos++;
}
// cout << "T" << i << " cnt-" << cnt << " : "; for (auto &it : ans) cout << it << ' ';cout << endl;
if (num[pos] >= 10) continue;
// cout << pos << " : ";
int j = pos;
while (j >= 0 && ans[j] == 0) j--;
for (; j >= 0; --j) cout << ans[j];cout << endl;
return;
}
}
signed main() {
#ifdef DEBUG
freopen("demo.in", "r", stdin);
freopen("demo.out", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(0);cout.tie(0);
int T;
cin >> T;
pw[0] = 1;
for (int i = 1; i <= 18; i ++ ) {
pw[i] = pw[i - 1] * 10;
// cout << pw[i] << endl;
}
for (int _ = 1; _ <= T; _ ++) {
solve();
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 0
Wrong Answer
time: 0ms
memory: 3492kb
input:
4 12345678 0 12345678 5 12345678 18 990099 5
output:
12345678 1 12345678 54322 12345678 999999999987654322 990099 9910
result:
wrong answer 1st lines differ - expected: '1', found: '12345678'