QOJ.ac
QOJ
| ID | 题目 | 提交者 | 结果 | 用时 | 内存 | 语言 | 文件大小 | 提交时间 | 测评时间 |
|---|---|---|---|---|---|---|---|---|---|
| #94934 | #6138. Function and Function | 2000805113# | TL | 2ms | 3412kb | C++17 | 512b | 2023-04-08 13:17:16 | 2023-04-08 13:17:19 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int T;
const int a[] = {1, 0, 0, 0, 1, 0, 1, 0, 2, 1};
int n, k;
int dfs(int x, int k) {
if(k == 0) return x;
if(x == 0) {
if(k & 1) return 1;
else return 0;
}
int sum = 0;
while(x) sum += a[x % 10], x /= 10;
return dfs(sum, k - 1);
}
void solve() {
cin >> n >> k;
cout << dfs(n, k) << "\n";
}
int main() {
ios :: sync_with_stdio(false);
cin >> T;
while(T--) solve();
return 0;
}
详细
Test #1:
score: 100
Accepted
time: 2ms
memory: 3412kb
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: -100
Time Limit Exceeded
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...