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
#include "cielib.h"
#include <bits/stdc++.h>
#define REP(a,b) for(int a=0; a<(b); ++a)
#define FWD(a,b,c) for(int a=(b); a<(c); ++a)
#define FWDS(a,b,c,d) for(int a=(b); a<(c); a+=d)
#define BCK(a,b,c) for(int a=(b); a>(c); --a)
#define ALL(a) (a).begin(), (a).end()
#define SIZE(a) ((int)(a).size())
#define VAR(x) #x ": " << x << " "
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define gcd __gcd
#define x first
#define y second
#define st first
#define nd second
#define pb push_back

using namespace std;

template<typename T> ostream& operator<<(ostream &out, const vector<T> &v){ out << "{"; for(const T &a : v) out << a << ", "; out << "}"; return out; }
template<typename S, typename T> ostream& operator<<(ostream &out, const pair<S,T> &p){ out << "(" << p.st << ", " << p.nd << ")"; return out; }

typedef long long LL;
typedef pair<int, int> PII;
typedef long double K;
typedef vector<int> VI;

const int dx[] = {0,0,-1,1}; //1,1,-1,1};
const int dy[] = {-1,1,0,0}; //1,-1,1,-1};

const int MAXD = 510;

int d, r;
int lo[MAXD];
int hi[MAXD];
int que[MAXD];

int main(){
	d = podajD();
	r = podajR();
	FWD(i,0,d){
		lo[i] = 0;
		hi[i] = r;
	}
	for(;;){
		int p = 0;
		FWD(i,1,d) if(hi[i] - lo[i] > hi[p] - lo[p]) p = i;
		if(hi[p] == lo[p] + 1) break;
		int o = 0;
		FWD(i,0,d){
			que[i] = (lo[i] + hi[i]) / 2;
			o = max(o, hi[i] - que[i]);
		}
		que[p] = lo[p];
		czyCieplo(que);
		que[p] = hi[p];
		if(czyCieplo(que))
			lo[p] = hi[p] - o;
		else
			hi[p] = lo[p] + o;
	}

	FWD(p,0,d){
		FWD(i,0,d) que[i] = (lo[i] + hi[i]) / 2;
		if(hi[p] < r){
			que[p] = hi[p]+1;
			czyCieplo(que);
			que[p] = lo[p];
			if(czyCieplo(que))
				hi[p] = lo[p];
			else
				lo[p] = hi[p];
		}else{
			que[p] = lo[p] - 1;
			czyCieplo(que);
			que[p] = hi[p];
			if(czyCieplo(que))
				lo[p] = hi[p];
			else
				hi[p] = lo[p];
		}
	}

	znalazlem(lo);
	return 0;
}