FazBrowse GitHub Viewer
|
Trending
|
URL:
|
Home
Tools:
[Download Repo ZIP]
[View Raw Code]
[Original HTTPS Page]
competitive-programming/fibonacci.cpp at master · harrypotter0/competitive-programming · GitHub
harrypotter0
competitive-programming
Repository navigation
Code
Issues
1
(1)
Pull requests
2
(2)
Actions
Projects
Security and quality
Insights
Expand file tree
Breadcrumbs
competitive-programming
/
fibonacci.cpp
Copy path
More file actions
More file actions
Latest commit
History
History
History
56 lines (45 loc) · 1008 Bytes
Breadcrumbs
competitive-programming
/
fibonacci.cpp
Copy path
File metadata and controls
56 lines (45 loc) · 1008 Bytes
Raw
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
#
include
<
bits/stdc++.h
>
#
define
MOD
1000000007
using
namespace
std
;
#
define
int
long
long
void
multi
(
int
F[
2
][
2
],
int
M[
2
][
2
]);
void
power
(
int
F[
2
][
2
],
int
n);
int
fib
(
int
n)
{
int
F[
2
][
2
] = {{
1
,
1
},{
1
,
0
}};
if
(n ==
0
)
return
0
;
power
(F, n-
1
);
return
F[
0
][
0
];
}
void
multi
(
int
F[
2
][
2
],
int
M[
2
][
2
])
{
int
x = ((F[
0
][
0
])%
MOD
*(M[
0
][
0
])%
MOD
+ (F[
0
][
1
])%
MOD
*(M[
1
][
0
])%
MOD
)%
MOD
;
int
y = ((F[
0
][
0
])%
MOD
*(M[
0
][
1
])%
MOD
+ (F[
0
][
1
])%
MOD
*(M[
1
][
1
])%
MOD
)%
MOD
;
int
z = ((F[
1
][
0
])%
MOD
*(M[
0
][
0
])%
MOD
+ (F[
1
][
1
])%
MOD
*(M[
1
][
0
])%
MOD
)%
MOD
;
int
w = ((F[
1
][
0
])%
MOD
*(M[
0
][
1
])%
MOD
+ (F[
1
][
1
])%
MOD
*(M[
1
][
1
])%
MOD
)%
MOD
;
F[
0
][
0
] = (
int
)(x%
MOD
);
F[
0
][
1
] = (
int
)(y%
MOD
);
F[
1
][
0
] = (
int
)(z%
MOD
);
F[
1
][
1
] = (
int
)(w%
MOD
);
}
void
power
(
int
F[
2
][
2
],
int
n)
{
if
(n ==
0
|| n ==
1
)
return
;
int
M[
2
][
2
] = {{
1
,
1
}, {
1
,
0
}};
power
(F, n/
2
);
multi
(F, F);
if
( n%
2
!=
0
)
multi
(F, M);
}
signed
main
()
{
int
test, n; cin >> test;
while
(test--)
{
cin >> n;
cout <<
fib
(n+
2
)%
MOD
<< endl;
}
return
0
;
}
Back
|
FazBrowse Home
|
New Git URL