QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#691098#6138. Function and FunctionA_Quark#AC ✓67ms3704kbC++20537b2024-10-31 09:51:132024-10-31 09:51:19

Judging History

你现在查看的是最新测评结果

  • [2024-10-31 09:51:19]
  • 评测
  • 测评结果:AC
  • 用时:67ms
  • 内存:3704kb
  • [2024-10-31 09:51:13]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll a[10] = {1,0,0,0,1,0,1,0,2,1};
ll f(ll n)
{
    if(n == 0) return 1;
    ll ret = 0;
    while(n)
    {
        ret += a[n%10];
        n /= 10;
    }
    return ret;
}
int main()
{
    ll z;
    cin >> z;
    while(z--)
    {
        ll n, k;
        cin >> n >> k;
        for(ll i=0; i<min(k, 40ll); i++)
            n = f(n);
        if(k <= 40) cout << n << '\n';
        else cout << (k+n) % 2 << '\n';
    }
    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 0ms
memory: 3564kb

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: 67ms
memory: 3704kb

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