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
#include <cstdio>
#include <cstring>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <iterator>
#include <string>
#include <vector>
#include <queue>
#include <bitset>
#include <utility>
#include <stack>

#include "cielib.h"

using namespace std;
typedef long long LL;
typedef pair<int,int> PII;
typedef vector<int> VI;
#define MP make_pair
#define FOR(v,p,k) for(int v=(p);v<=(k);++v)
#define FORD(v,p,k) for(int v=(p);v>=(k);--v)
#define REP(i,n) for(int i=0;i<(n);++i)
#define VAR(v,i) __typeof(i) v=(i)
#define FOREACH(i,c) for(VAR(i,(c).begin());i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second
#define SIZE(x) (int)x.size()
#define ALL(c) c.begin(),c.end()

#define ODD(x) ((x)%2)
#define EVEN(x) (!(ODD(x)))


int main() {
    int d = podajD();
    int k = podajK();
    int r = podajR();

    int t[d];
    int best[d];
    REP(i,d) {
        t[i] = r/2;
    }
    memcpy(best, t, d*sizeof(int));

    int max_diff = r;
    int all_k=k-1;

    //factor^{all_k-d}=r
    double factor = pow(r, 1.0/(all_k));

    auto call_czyCieplo =[&]()->int {
        k--;
        max_diff = int(max_diff/factor);
        max_diff = max(1, max_diff);
        return czyCieplo(t);
    };

    czyCieplo(t);
    k--;

    while (k > 0) {

        REP(i,d) {
            int curr = best[i];
            int from = max(0, curr - max_diff);
            int to = min(r, curr + max_diff);
            t[i] = from + (rand() % (to - from + 1));
        }

        if (call_czyCieplo()) {
            memcpy(best, t, d*sizeof(int));
        } else if (k>0) {
            memcpy(t, best, d*sizeof(int));
            call_czyCieplo();
        }

    }
    znalazlem(best);
    return 0;
}