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
#include <bits/stdc++.h>
#include "dzilib.h"
#define FOR(i, a, b) for(int i =(a); i < (b); ++i)
#define re(i, n) FOR(i, 1, n)
#define ford(i, a, b) for(int i = (a); i >= (b); --i)
#define rep(i, n) for(int i = 0;i <(n); ++i)
#define all(x) (x).begin(), (x).end()
#define sz(x) (int) (x).size()

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef vector<ll> vll;
typedef vector<int> vi;
typedef vector<pll> vpll;
typedef vector<pii> vpii;

const ll inf = 1e18;
const int N = 2e6 + 1;
const int mod = 1e9 + 7;

int dcnt[N] = {0};
vll cur_cand;

int main()
{
    for (int i = 1; i < N; i++)
    {
        for (int j = i; j < N; j += i) 
        {
            dcnt[j]++;
        }
    }
    ll t = GetT();
    ll c = GetC();
    ll n = GetN();
    if (n > 1e6)
    {
        cout << "DUUUUUUUPA\n";
        return 0;
    }
    while (t--)
    {
        cur_cand.clear();
        rep(i, n+1)
        {
            cur_cand.push_back(i);
        }
        ll act = 0;
        while (sz(cur_cand) > 1)
        {
            ll response = Ask(act);
            vll new_cand;
            for (ll v : cur_cand)
            {
                if (dcnt[v + act] == response) new_cand.push_back(v);
            }
            new_cand.swap(cur_cand);
            act++;
            cout.flush();
            //for (int v : cur_cand) cout << v << " ";
        }
        Answer(cur_cand.back());
    }
}