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
/*****************
 * Adam Pawloski *
 *****************/

#include <bits/stdc++.h>
using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef set<int> SI;
typedef pair<int, int> PII;
typedef vector<pair<int, int> > VPII;

const int INF = 1000000001;
const int EPS = 1e-9;
const int MOD = 1000000007;

//813437586

#define ALL(c) (c).begin(), (c).end()
#define SIZE(x) ((int)(x).size())
#define VAR(v, n) auto v = (n)
#define FOREACH(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)

#define MP make_pair
#define PB push_back
#define ST first
#define ND second


/*************************** END OF TEMPLATE ***************************/

#include "cielib.h"

const int maxd = 500;
const int maxr = 1000000000;

int d, r;

int anw[maxd];
int pom[maxd];

void spr()
{
	czyCieplo(anw);
	if(czyCieplo(pom) == 1)
		for(int i = 0; i < d; i++)
			anw[i] = pom[i];
}

void konstr(int a)
{
	for(int i = 0; i <= r; i++)
	{
		pom[a] = i;
		if(a < d-1)
			konstr(a+1);
		else
			spr();
	}
}

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

	znalazlem(anw);
}