QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#496806#6138. Function and Functionucup-team1198#AC ✓13ms3784kbC++20730b2024-07-28 16:15:002024-07-28 16:15:00

Judging History

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

  • [2024-07-28 16:15:00]
  • 评测
  • 测评结果:AC
  • 用时:13ms
  • 内存:3784kb
  • [2024-07-28 16:15:00]
  • 提交

answer

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define pii pair<int, int>
#define ld long double
#define all(a) (a).begin(), (a).end()

vector<int> t = {1, 0, 0, 0, 1, 0, 1, 0, 2, 1};

int f(int x) {
    if (x == 0) return 1;
    int res = 0;
    while (x) {
        res += t[x % 10];
        x /= 10;
    }
    return res;
}

void solve() {
    int x, k;
    cin >> x >> k;

    while (x != 0 && k != 0) {
        x = f(x);
        --k;
    }

    if (k == 0) {
        cout << x << '\n';
        return;
    }

    cout << (k % 2 == 0 ? 0 : 1) << '\n';
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

    int t;
    cin >> t;
    while (t--) solve();

    return 0;
}

Details

Tip: Click on the bar to expand more detailed information

Test #1:

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

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: 13ms
memory: 3784kb

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