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
#include "cielib.h"
#include <cmath>
#include <cstdio>

//#define NDEBUG
#include <cassert>

using namespace std;

int D;
int K;
int r;

int minD[500];
int maxD[500];
int usedK;

int currentPoint[500];
int foundedPoint[500];

bool cc(){
    //for(int i = 0; i < D; ++i)
   //             printf("%i ", currentPoint[i]);
   // printf("<- sprawdzam\n");


    if(usedK == K) znalazlem(minD);

    usedK++;
    return czyCieplo(currentPoint) == 1;
}

inline bool cmm(int d) { return minD[d] == maxD[d]; }

int main() {
	D = podajD();
	K = podajK();
	r = podajR();

    for(int i = 0; i < D; i++){
        minD[i] = 0;
        maxD[i] = r;
    }

    int lastD = 0;
    while(true){
        bool flFound = true;
        for(int d = 0; d < D; d++){
            if(minD[d] < maxD[d])
                flFound = false;
            currentPoint[d] = (minD[d] + maxD[d])/2;
        }

        if(flFound){
     //       for(int i = 0; i < D; ++i)
       //         printf("%i ", minD[i]);
         //   printf("<- znalezione\n");
            znalazlem(minD);
        }

        cc();

        for(int d = 0; d < D; ++d, lastD = (lastD+1)%D){
            if(minD[lastD] == maxD[lastD]) continue;
            if(currentPoint[lastD] > 0){
                currentPoint[lastD]--;
                if(cc()){
                    maxD[lastD] = currentPoint[lastD];
                    goto continueToNextBigIteration;
                } else {
                    currentPoint[lastD]++;
                    if(cc()){
                        if(minD[lastD] < currentPoint[lastD]){
                            minD[lastD] = currentPoint[lastD];
                            goto continueToNextBigIteration;
                        }
                    }
                }
            }

            if(currentPoint[lastD] < r){
                currentPoint[lastD]++;
                if(cc()){
                    minD[lastD] = currentPoint[lastD];
                    goto continueToNextBigIteration;
                } else {
                    currentPoint[lastD]--;
                    if(cc()){
                        if(maxD[lastD] > currentPoint[lastD]){
                            maxD[lastD] = currentPoint[lastD];
                            goto continueToNextBigIteration;
                        }
                    }
                }
            }

        }

        //FINISHING ON unit cube
        flFound = true;
        for(int d = 0; d < D; d++){
            if(maxD[d] - minD[d] > 1)
                minD[d] = maxD[d] = (maxD[d]+minD[d])/2;

            if(maxD[d] != minD[d]) flFound = false;

            currentPoint[d] = minD[d] == 0 ? 0 : maxD[d];
        }

        if(flFound) znalazlem(minD);
        cc();

        for(int d = 0; d < D; d++){
            currentPoint[d] = minD[d] == 0 ? maxD[d] : minD[d];
            foundedPoint[d] = currentPoint[d];
        }

        if(cc()) znalazlem(currentPoint);

        for(int d = 0; d < D; d++){
            if(minD[d] == maxD[d]) continue;

            if(currentPoint[d] == maxD[d]){
                currentPoint[d]++;
                cc();
                currentPoint[d]--;
                if(cc()) maxD[d] = minD[d];
                else minD[d] = maxD[d];
            } else {
                currentPoint[d]--;
                cc();
                currentPoint[d]++;
                if(cc()) minD[d] = maxD[d];
                else maxD[d] = minD[d];
            }
        }

        znalazlem(minD);

        continueToNextBigIteration:
            ;
    }
}