QOJ.ac
QOJ
ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
---|---|---|---|---|---|---|---|---|---|
#221369 | #6138. Function and Function | ucup-team1001# | AC ✓ | 14ms | 3800kb | C++20 | 487b | 2023-10-21 12:53:54 | 2023-10-21 12:53:54 |
Judging History
answer
#include<bits/stdc++.h>
using namespace std;
vector<int>f = {1,0,0,0,1,0,1,0,2,1};
#define ll long long
ll calc(ll n, ll m){
if(m == 0)return n;
if(n == 0 || n == 1)m %= 2;
if(m == 0)return n;
ll sum = 0;
if(n == 0)return calc(1, m - 1);
while(n){
int base = n % 10;
sum += f[base];
n /= 10;
}
return calc(sum, m - 1);
}
int main(){
int T;
scanf("%d", &T);
while(T --){
int n, m;
scanf("%d%d",&n,&m);
printf("%lld\n", calc(n, m));
}
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 0ms
memory: 3800kb
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: 3796kb
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