-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathUntitled9.cpp
46 lines (36 loc) · 981 Bytes
/
Untitled9.cpp
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
#include <stdio.h>
#define MOD 1000000007
void multiply(long long F[2][2], long long M[2][2]);
void power(long long F[2][2], long long n);
long long fib(long long n) {
long long F[2][2] = {{1,1},{1,0}};
if (n == 0)
return 0;
power(F, n - 1);
return F[0][0];
}
void multiply(long long F[2][2], long long M[2][2]) {
long long x = (F[0][0]*M[0][0] + F[0][1]*M[1][0]) % MOD;
long long y = (F[0][0]*M[0][1] + F[0][1]*M[1][1]) % MOD;
long long z = (F[1][0]*M[0][0] + F[1][1]*M[1][0]) % MOD;
long long w = (F[1][0]*M[0][1] + F[1][1]*M[1][1]) % MOD;
F[0][0] = x;
F[0][1] = y;
F[1][0] = z;
F[1][1] = w;
}
void power(long long F[2][2], long long n) {
if( n == 0 || n == 1)
return;
long long M[2][2] = {{1,1},{1,0}};
power(F, n/2);
multiply(F, F);
if (n % 2 != 0)
multiply(F, M);
}
int main() {
long long n;
scanf("%lld", &n);
printf("%lld\n", fib(n+2) - 1);
return 0;
}