Skip to content

Commit c93f3ef

Browse files
committed
fix inttypes
1 parent 4c7685f commit c93f3ef

File tree

1 file changed

+6
-5
lines changed

1 file changed

+6
-5
lines changed

others/fibonacci_fast.cpp

Lines changed: 6 additions & 5 deletions
Original file line numberDiff line numberDiff line change
@@ -7,20 +7,21 @@
77
// have already found n/2th or (n+1)/2th fibonacci It is a property of fibonacci
88
// similar to matrix exponentiation.
99

10+
#include <cinttypes>
1011
#include <cstdio>
1112
#include <iostream>
1213

13-
const long long MAX = 93;
14+
const uint64_t MAX = 93;
1415

15-
long long f[MAX] = {0};
16+
uint64_t f[MAX] = {0};
1617

17-
long long fib(long long n) {
18+
uint64_t fib(uint64_t n) {
1819
if (n == 0) return 0;
1920
if (n == 1 || n == 2) return (f[n] = 1);
2021

2122
if (f[n]) return f[n];
2223

23-
long long k = (n % 2 != 0) ? (n + 1) / 2 : n / 2;
24+
uint64_t k = (n % 2 != 0) ? (n + 1) / 2 : n / 2;
2425

2526
f[n] = (n % 2 != 0) ? (fib(k) * fib(k) + fib(k - 1) * fib(k - 1))
2627
: (2 * fib(k - 1) + fib(k)) * fib(k);
@@ -29,7 +30,7 @@ long long fib(long long n) {
2930

3031
int main() {
3132
// Main Function
32-
for (long long i = 1; i < 93; i++) {
33+
for (uint64_t i = 1; i < 93; i++) {
3334
std::cout << i << " th fibonacci number is " << fib(i) << "\n";
3435
}
3536
return 0;

0 commit comments

Comments
 (0)