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
#include <bits/stdc++.h>
#include "cielib.h"
using namespace std;
#define FOR(i,a,b) for(int i=(a); i<(b); ++i)
//#define REP(i,n) FOR(i,1,(n)+1)
typedef vector<int> vi;
#define pb push_back
#define sz size()
typedef pair<int,int> pii;
#define mp make_pair
#define st first
#define nd second
typedef long long ll;
#define INF 1000000001
//#define VAR(n,v) typeof(v) n=(v)
#define ALL(t) t.begin(),t.end()
#define SC(a) scanf("%d", &a)
#define GET(a) int a; SC(a)

#define ISDEBUG 0
#define dprintf(...) if(ISDEBUG) \
{printf("\033[31m"); printf(__VA_ARGS__); printf("\033[0m");}
template <class It> void dptab(It b, It e, const char* f="%d ") {
	if(ISDEBUG) {
		for(It it=b; it!=e; ++it) dprintf(f, *it); dprintf("\n");
}}

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

	int u[d], v[d], pos[d];
	FOR(i,0,d) {
		u[i] = 0;
		v[i] = r;
		pos[i] = (r/2);
	}

	bool end = false;
	while(!end) {
		end = true;
		FOR(i,0,d) {
			dprintf("  (u, v)[%d] = (%d, %d)\n", i, u[i], v[i]);
			if(v[i]-u[i] > 1) {
				end = false;
				pos[i] = v[i];
				czyCieplo(pos);
				pos[i] = u[i];
				bool result = czyCieplo(pos);
				if(result) {
					v[i] = ceil((v[i]+u[i])/2.0);
				} else {
					u[i] = (v[i]+u[i])/2;
				}
				pos[i] = (u[i]+v[i])/2;
			}
		}
	}

	FOR(i,0,d) {
		if(v[i] == r) {
			pos[i] = u[i] - 1;
			czyCieplo(pos);
			pos[i] = v[i];
			bool result = czyCieplo(pos);
			if(!result) pos[i] = u[i];
		} else {
			pos[i] = v[i] + 1;
			czyCieplo(pos);
			pos[i] = u[i];
			bool result = czyCieplo(pos);
			if(!result) pos[i] = v[i];
		}
	}

	znalazlem(pos);
	return 0;
}