File tree Expand file tree Collapse file tree 1 file changed +6
-5
lines changed Expand file tree Collapse file tree 1 file changed +6
-5
lines changed Original file line number Diff line number Diff line change 7
7
// have already found n/2th or (n+1)/2th fibonacci It is a property of fibonacci
8
8
// similar to matrix exponentiation.
9
9
10
+ #include < cinttypes>
10
11
#include < cstdio>
11
12
#include < iostream>
12
13
13
- const long long MAX = 93 ;
14
+ const uint64_t MAX = 93 ;
14
15
15
- long long f[MAX] = {0 };
16
+ uint64_t f[MAX] = {0 };
16
17
17
- long long fib (long long n) {
18
+ uint64_t fib (uint64_t n) {
18
19
if (n == 0 ) return 0 ;
19
20
if (n == 1 || n == 2 ) return (f[n] = 1 );
20
21
21
22
if (f[n]) return f[n];
22
23
23
- long long k = (n % 2 != 0 ) ? (n + 1 ) / 2 : n / 2 ;
24
+ uint64_t k = (n % 2 != 0 ) ? (n + 1 ) / 2 : n / 2 ;
24
25
25
26
f[n] = (n % 2 != 0 ) ? (fib (k) * fib (k) + fib (k - 1 ) * fib (k - 1 ))
26
27
: (2 * fib (k - 1 ) + fib (k)) * fib (k);
@@ -29,7 +30,7 @@ long long fib(long long n) {
29
30
30
31
int main () {
31
32
// Main Function
32
- for (long long i = 1 ; i < 93 ; i++) {
33
+ for (uint64_t i = 1 ; i < 93 ; i++) {
33
34
std::cout << i << " th fibonacci number is " << fib (i) << " \n " ;
34
35
}
35
36
return 0 ;
You can’t perform that action at this time.
0 commit comments