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
#include <bits/stdc++.h>
#include "cielib.h"
using namespace std;
const int D = 510;
int arr[D], a[D], b[D];
int main() {
    int d = podajD(), r = podajR();
    for(int i = 0; i < d; ++i)
        b[i] = r;
    bool loop = true;
    while(loop) {
        loop = false;
        for(int i = 0; i < d; ++i)
            arr[i] = (a[i] + b[i]) >> 1;
        for(int i = 0; i < d; ++i) {
            if(a[i] == b[i])
                continue;
            int temp = arr[i];
            if(b[i] - a[i] == 1) {
                arr[i] = a[i];
                czyCieplo(arr);
                arr[i] = b[i];
                if(czyCieplo(arr)) {
                    a[i] = b[i];
                    arr[i] = temp;
                    loop = true;
                    continue;
                }
                arr[i] = a[i];
                if(czyCieplo(arr)) {
                    b[i] = a[i];
                    arr[i] = temp;
                    loop = true;
                    continue;
                }
                if(a[i] > 0) {
                    arr[i] = a[i] - 1;
                    czyCieplo(arr);
                    arr[i] = b[i];
                    if(czyCieplo(arr)) {
                        a[i] = b[i];
                        arr[i] = temp;
                        loop = true;
                    }
                    else {
                        b[i] = a[i];
                        arr[i] = temp;
                        loop = true;
                    }
                }
                else {
                    arr[i] = b[i] + 1;
                    czyCieplo(arr);
                    arr[i] = a[i];
                    if(czyCieplo(arr)) {
                        b[i] = a[i];
                        arr[i] = temp;
                        loop = true;
                    }
                    else {
                        a[i] = b[i];
                        arr[i] = temp;
                        loop = true;
                    }
                }
            }
            else {
                arr[i] = a[i];
                czyCieplo(arr);
                arr[i] = b[i];
                if(czyCieplo(arr))
                    a[i] = (a[i] + b[i]) >> 1;
                else
                    b[i] = (a[i] + b[i] + 1) >> 1;
                arr[i] = temp;
                loop = true;
            }
        }
    }
    znalazlem(arr);
    return 0;
}