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
 88
 89
 90
 91
 92
 93
 94
 95
 96
 97
 98
 99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
#include "cielib.h"

using namespace std;

int d, k, r;
int currDim;
int *t;

class Cie2016Problem
{
public:

	int get13(int lowest, int highest)
	{
		int diff = highest - lowest;
		int next = lowest + diff / 3;
		if (next == lowest)
		{
			next++;
		}
		if (next > highest)
		{
			next = highest;
		}
		return next;
	}

	int get23(int lowest, int highest)
	{
		int diff = highest - lowest;
		int next = lowest + 2 * diff / 3;
		if (next == lowest)
		{
			next++;
		}
		if (next > highest)
		{
			next = highest;
		}
		return next;
	}

	int get12(int lowest, int highest)
	{
		int diff = highest + lowest;
		int next = diff / 2;
		if (next == lowest)
		{
			next++;
		}
		if (next > highest)
		{
			next = highest;
		}
		return next;
	}

	int find(int lowest, int highest, int closest)
	{
		t[currDim] = closest;
		if (lowest == highest)
		{
			return lowest;
		}

		int next;
		int res;
		if (closest == lowest)
		{
			next = get23(lowest, highest);
			t[currDim] = next;
			if (czyCieplo(t))
			{
				lowest = get12(lowest, next);
				res = find(lowest, highest, next);
				return res;
			}
			else
			{
				highest = get13(lowest, highest);
				res = find(lowest, highest, lowest);
				return res;
			}
		}
		else
		{
			next = get23(closest, highest);
			t[currDim] = next;
			if (czyCieplo(t))
			{
				lowest = get12(closest, next);
				res = find(lowest, highest, next);
				return res;
			}
			else
			{
				highest = get12(closest, next);
				res = find(lowest, highest, next);
				return res;
			}
		}
	}

	int find0()
	{
		int best = 0;
		for (int i = 1; i <= r; i++)
		{
			t[currDim] = i;
			if (!czyCieplo(t))
			{
				t[currDim] = best;
				break;
			}
			else
			{
				best = i;
			}
		}
		return best;
	}

	void calc0()
	{
		czyCieplo(t);
		for (int i = 0; i < d; i++)
		{
			currDim = i;
			int val_i = find0();
			t[i] = val_i;
		}
	}

	void calc()
	{
		czyCieplo(t);
		for (int i = 0; i < d; i++)
		{
			currDim = i;
			int val_i = find(0, r, 0);
			t[i] = val_i;
		}
	}
};

int main()
{
	Cie2016Problem *p = new Cie2016Problem();

	d = podajD();
	k = podajK();
	r = podajR();

	t = new int[d];
	for (int i = 0; i < d; i++) 
	{
		t[i] = 2;
	}

	for (int i = 0; i < 100; i++)
	{
		czyCieplo(t);
	}

	//p->calc();
	znalazlem(t);

	delete t;
	delete p;
	return 0;
}