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
#include <iostream>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <algorithm>
#include <map>
#include <cmath>
#include <set>
#include "cielib.h"
#define ALL(X)        X.begin(),X.end()
#define FOR(I,A,B)    for(int (I) = (A); (I) <= (B); (I)++)
#define FORW(I,A,B)   for(int (I) = (A); (I) < (B);  (I)++)
#define FORD(I,A,B)   for(int (I) = (A); (I) >= (B); (I)--)
#define CLEAR(X)      memset(X,0,sizeof(X))
#define SIZE(X)       int(X.size())
#define CONTAINS(A,X) (A.find(X) != A.end())
#define PB            push_back
#define MP            make_pair
#define X             first
#define Y             second
using namespace std;
template<typename T, typename U> ostream& operator << (ostream& os, const pair<T, U> &_p) { return os << "(" << _p.X << "," << _p.Y << ")"; }
template<typename T> ostream& operator << (ostream &os, const vector<T>& _V) { bool f = true; os << "["; for(auto v: _V) { os << (f ? "" : ",") << v; f = false; } return os << "]"; }
template<typename T> ostream& operator << (ostream &os, const set<T>& _S) { bool f = true; os << "("; for(auto s: _S) { os << (f ? "" : ",") << s; f = false; } return os << ")"; }
template<typename T, typename U> ostream& operator << (ostream &os, const map<T, U>& _M) { return os << set<pair<T, U>>(ALL(_M)); }
typedef signed long long slong;
typedef long double ldouble;
const slong INF = 1000000100;
const ldouble EPS = 1e-9;

int D, K, R;

void read_data() {
    D = podajD();
    K = podajK();
    R = podajR();
}

int poz[542];

void solve() {
    vector<int> st(D,0), en(D,R);
    while(st[0] < en[0])
    {
        FORW(i,0,D)
        {
            poz[i] = (st[i]+en[i])/2;
        }
        int c = (en[0]-st[0]+1)/2;
        FORW(i,0,D)
        {
            int old = poz[i];
            poz[i] = en[i];
            czyCieplo(poz);
            poz[i] = st[i];
            int a = czyCieplo(poz);
            poz[i] = en[i];
            int b = czyCieplo(poz);
            if(c == 1)
            {
                if(a)
                {
                    en[i] = st[i];
                }
                else if(b)
                {
                    st[i] = en[i];
                }
                else
                {
                    st[i] = en[i] = st[i] + 1;
                }
            }
            else if(a)
            {
                en[i] = st[i] + c;
            }
            else
            {
                st[i] = en[i] - c;
            }
            poz[i] = old;
        }
    }
    FORW(i,0,D)
    {
        poz[i] = st[i];
    }
    znalazlem(poz);
}

int main() {
    read_data();
    solve();
}