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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include "cielib.h"

using namespace std;

typedef vector<int> VI;
typedef long long LL;
#define FOR(x, b, e) for(int x = b; x<=(e);++x)
#define FORD(x, b, e) for(int x = b; x>=(e);--x)
#define REP(x, n) for(int x = 0; x < (n);++x)
#define VAR(v, n) __typeof(n)v = (n)
#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define FOREACH(i,c) for(VAR(i, (c).begin()); i!=(c).end();++i)
#define PB push_back
#define ST first
#define ND second

int main() {

  int d = podajD();
  int r = podajR();

  VI res(d);
  REP(i, d) res[i] = 0;

  REP(i, d) {
    czyCieplo(&res[0]);
    int p = 0, q = r;
    //cout << p << ", " << q << endl;

    while(p < q) {
      int old = res[i];
      res[i] = (p + q) / 2;

      int check = czyCieplo(&res[0]);

      if(old - res[i] > 0 && check == 0 || old - res[i] < 0 && check == 1) {
        p = res[i];
      } else {
        q = res[i];
      }
      //cout << p << ", " << q << endl;

    }
  }

  //FOREACH(it, res) cout << *it << " | "; cout << endl;

  znalazlem(&res[0]);

  return 0;
}