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

int U[1000];
int x[1000];

int d;

int reduce(int r)
{
  int hr = r/2;
  for(int i=0; i<d; i++)
    x[i] = U[i]+hr;

  for(int i=0; i<d; i++)
  {
    x[i] = U[i];
    czyCieplo(x);
    x[i] = U[i]+r;
    if(czyCieplo(x))
    {
      U[i] = U[i] + hr;
      x[i] = U[i] + r/4;
    }
    else
    {
      x[i] = U[i] + r/4;
    }
  }
  return (r+1)/2;
}

void reduce2()
{
  for(int i=0; i<d; i++)
    x[i] = U[i]+1;

  for(int i=0; i<d; i++)
  {
    x[i] = U[i];
    czyCieplo(x);
    x[i] = U[i]+2;
    if(czyCieplo(x))
    {
      x[i] = U[i]+2;
    }
    else
    {
      x[i] = U[i];
      if(!czyCieplo(x))
      {
        x[i] = U[i] + 1;
      }
    }
  }
}

void start()
{
  int r = podajR();
  while(r > 2)
    r = reduce(r);
  reduce2();
}

int main()
{
  d = podajD();
  start();
  znalazlem(x);
  return 0;
}