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
#include "cielib.h"
using namespace std;
long long D, R, l, p, s1, s2;
int main()
{
    D = podajD();
    R = podajR();

    int tab[D];

    for (int i = 0; i < D; i++) tab[i] = 0;

    for (int i = 0; i < D; i++)
    {
        l = 0, p = R;
        while (l < p)
        {
            if (p - l == 1)
            {
                tab[i] = l;
                czyCieplo(tab);

                tab[i] = p;
                if (!czyCieplo(tab)) tab[i] = l;
                break;
            }

            s1 = (l + p)/2;
            s2 = s1 + 1;

            tab[i] = s1;
            czyCieplo(tab);

            tab[i] = s2;
            if (czyCieplo(tab)) l = s2;
            else
            {
                p = s1;
                tab[i] = s1;
            }
        }
    }

    znalazlem(tab);

    return 0;
}