QOJ.ac
QOJ
ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
---|---|---|---|---|---|---|---|---|---|
#326414 | #6138. Function and Function | Lain | AC ✓ | 17ms | 3740kb | C++23 | 686b | 2024-02-13 00:49:59 | 2024-02-13 00:50:01 |
Judging History
answer
#include "bits/stdc++.h"
using namespace std;
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
const vector<int> F = {1,0,0,0,1,0,1,0,2,1};
auto f = [&](int x)->int {
if (x == 0) return 1;
int ans = 0;
while(x) {
int dig = x%10;
x /= 10;
ans += F[dig];
}
return ans;
};
int tt;
cin >> tt;
while(tt--) {
int x, k;
cin >> x >> k;
while(x && k) {
k--;
x = f(x);
}
if (k == 0) {
cout << x << '\n';
continue;
}
assert(x == 0);
if (k%2 == 1) {
cout << 1 << '\n';
} else {
cout << 0 << '\n';
}
}
}
詳細信息
Test #1:
score: 100
Accepted
time: 1ms
memory: 3740kb
input:
6 123456789 1 888888888 1 888888888 2 888888888 999999999 98640 12345 1000000000 0
output:
5 18 2 0 0 1000000000
result:
ok 6 numbers
Test #2:
score: 0
Accepted
time: 17ms
memory: 3580kb
input:
100000 579268184 2 120252252 777743676 255650198 1 152055433 207664522 137430584 754115403 646417467 164848484 743551976 0 0 408695577 363072674 569574204 464290891 0 761830281 3 0 1 49176280 2 791182580 0 474930784 3 402374924 0 739903247 91553857 0 2 688106229 2 65907033 152261569 875191599 3 5319...
output:
0 0 5 0 1 1 743551976 1 1 464290891 0 1 1 791182580 1 402374924 0 0 2 0 1 1 2 1 0 0 0 3 0 0 0 1 0 0 1 0 2 0 1 1 1 0 1 0 0 0 0 0 0 1 55349255 486354015 1 1 0 1 1 0 1 1 0 1 0 9 0 1 1 0 0 1 0 1 1 1 0 0 0 0 25600152 0 0 1 22903397 705086250 771453912 1 1 0 0 1 0 1 1 1 2 1 1 1 1 1 1 6 3 3 1 0 1 0 1 86248...
result:
ok 100000 numbers