Hugging Face's logo

Datasets:
slayone
/
uva_spoj_raw

Tasks:
Translation
Text Generation
Size:
1K<n<10K
Tags:
code
License:
Dataset card Files Community
uva_spoj_raw
File size: 2,799 Bytes 
c4b0eef
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
 
#include <bits/stdc++.h>
using namespace std;

#define ll long long

ll dp[10009][105][2], n, mv;

ll solve(ll num, ll mov, ll state)

{
    if(mov > mv) {
        if(num > n) {
            if(state == 0)
                return 1;
            else
                return 0;
        }
        else {
            if(state == 0)
                return 0;
            else
                return 1;
        }
    }

    ll &ret = dp[num][mov][state];
    if(ret != -1)
        return ret;

    ll rt = 0;
    if(num > 999) {
        if(num % 10 != 9)
            rt |= !solve(num + 1, mov + 1, state ^ 1);
        else
            rt |= !solve(num - 9, mov + 1, state ^ 1);

        if(num % 100 < 90)
            rt |= !solve(num + 10, mov + 1, state ^ 1);
        else
            rt |= !solve(num - 90, mov + 1, state ^ 1);

        if(num % 1000 < 900)
            rt |= !solve(num + 100, mov + 1, state ^ 1);
        else
            rt |= !solve(num - 900, mov + 1, state ^ 1);

        if(num % 10000 < 9000)
            rt |= !solve(num + 1000, mov + 1, state ^ 1);
        else
            rt |= !solve(num - 9000, mov + 1, state ^ 1);
    }
    else if(num > 99) {
        if(num % 10 != 9)
            rt |= !solve(num + 1, mov + 1, state ^ 1);
        else
            rt |= !solve(num - 9, mov + 1, state ^ 1);

        if(num % 100 < 90)
            rt |= !solve(num + 10, mov + 1, state ^ 1);
        else
            rt |= !solve(num - 90, mov + 1, state ^ 1);

        if(num % 1000 < 900)
            rt |= !solve(num + 100, mov + 1, state ^ 1);
        else
            rt |= !solve(num - 900, mov + 1, state ^ 1);

        rt |= !solve(num + 1000, mov + 1, state ^ 1);
    }

    else if(num > 9) {
        if(num % 10 != 9)
            rt |= !solve(num + 1, mov + 1, state ^ 1);
        else
            rt |= !solve(num - 9, mov + 1, state ^ 1);

        if(num % 100 < 90)
            rt |= !solve(num + 10, mov + 1, state ^ 1);
        else
            rt |= !solve(num - 90, mov + 1, state ^ 1);

        rt |= !solve(num + 100, mov + 1, state ^ 1);
        rt |= !solve(num + 1000, mov + 1, state ^ 1);
    }

    else {
        if(num % 10 != 9)
            rt |= !solve(num + 1, mov + 1, state ^ 1);
        else
            rt |= !solve(num - 9, mov + 1, state ^ 1);

        rt |= !solve(num + 10, mov + 1, state ^ 1);
        rt |= !solve(num + 100, mov + 1, state ^ 1);
        rt |= !solve(num + 1000, mov + 1, state ^ 1);
    }

    //cout << num << "  " << rt << "  " << state << endl;
    return ret = rt;
}

int main()

{
    ll t;
    cin >> t;
    while(t--) {
        memset(dp, -1, sizeof(dp));
        scanf("%lld %lld", &n, &mv);

        if( solve(n, 1, 0) == 1)
            printf("Ada\n");
        else
            printf("Vinit\n");
    }

    return 0;
}