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
#include <bits/stdc++.h>
#include "dzilib.h"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
using namespace __gnu_pbds;
using namespace std;
#define pb push_back
#define st first
#define nd second
typedef long long ll;
typedef long double ld;
const ll I = 1000LL * 1000LL * 1000LL * 1000LL * 1000LL * 1000LL;
const ll M = 1000LL * 1000LL * 1000LL + 7LL;
const int N = 1000 * 1000 + 7;
int il[2 * N];
vector<int> grp[N], pos, nw;

void Sieve(int n)
{
    for(int i = 1; i <= n; ++i)
    {
        for(int j = i; j <= n * 2; j += i)
            ++il[j];
        grp[il[i]].pb(i);
    }
}

void Solve(int n, int q)
{
    int cur, i;
    cur = Ask(0);
    pos = grp[cur];
    for(int i = 1; i <= q - 1 && pos.size() > 1; ++i)
    {
        cur = Ask(i);
        for(int j = 0; j < (int)pos.size(); ++j)
            if(il[pos[j] + i] == cur) nw.pb(pos[j]);
        pos = nw;
        nw.clear();
    }
    Answer(pos[0]);
}

int main()
{
    //ios_base::sync_with_stdio(false);
    //cin.tie(nullptr);
    Sieve(N - 7);
    int t, n, q, c;
    t = GetT();
    n = GetN();
    q = GetQ();
    c = GetC();
    q /= t;
    while(t--)
        Solve(n, q);

    return 0;
}