QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#533806 | #6138. Function and Function | Tomato_Fish# | AC ✓ | 14ms | 3880kb | C++14 | 537b | 2024-08-26 14:53:38 | 2024-08-26 14:53:38 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
int g[10]={1,0,0,0,1,0,1,0,2,1};
int f(int x){
int e=0;
while(x){
e+=g[x%10];
x/=10;
}
return e;
}
int main()
{
int T;
scanf("%d",&T);
while(T--){
int x,K;
scanf("%d%d",&x,&K);
while(x&&K){
x=f(x);
K--;
}
if(!x){
if(K&1) printf("1\n");
else printf("0\n");
}
else printf("%d\n",x);
}
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3880kb
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: 14ms
memory: 3780kb
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