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
#include<cstdio>

long long cycle[20];

int main() {
  cycle[1] = 60;
  cycle[2] = 300;
  cycle[3] = 1500;
  for (int i = 4; i <= 18; i++) {
    cycle[i] = cycle[i-1]*10;
  }

  long long n;
  scanf("%lld", &n);
  
  if (!n) {
    printf("0\n");
    return 0;
  }

  int power = 1;
  long long k = 10;
  while(n%k != n) {
    power++;
    k*=10;
  }

  unsigned long long x = 1;
  unsigned long long y = 1;
  int act = 1;
  int mod=10;

  for(int i = 2; i < cycle[act]; i++) {
    if (y%k == n) {
      printf("%lld\n", y);
      return 0;
    }
    
    while (y%mod == n%mod) {
      act++;
      mod*=10;
    }

    unsigned long long temp = y;
    y=(x+y)%1000000000000000000;
    x=temp;
  }
  printf("NIE\n");

return 0;
}