Helo gais, i am not a c dev but kind want

Question

Helo gais, i am not a c dev but kind want

to check wasm , wrote one fibonacci thing, but it will overflow after a while when the input element grows, how to tackle it ? if possible without breaking my head and without gmp or other libraries?
unsigned long long fibonaccisum(int n) {
unsigned long long a = 0, b = 1, temp, sum = 1;

if (n <= 1) {
return n;
}

for (int i = 2; i <= n; ++i) {
temp = a + b;
a = b;
b = temp;
}

return b;
}

0

19.12.2023

3 ответов

23 просмотра

Jass Автор вопроса

²
temp = a + b -- cause to overflow

ya but the fibonacci sum itself will cause it , i see no way to avoid it unless i have my custom return type that is formed by either some kinda array system or gmp

0

11 месяцев назад

Adrian

Jass
ya but the fibonacci sum itself will cause it , i ...

well you will have to work with strings instead

0

11 месяцев назад

² · Accepted Answer

²

temp = a + b -- cause to overflow

0

11 месяцев назад

Похожие чаты

Helo gais, i am not a c dev but kind want

3 ответов

Похожие вопросы