Professional Documents
Culture Documents
Fibonaci
Fibonaci
h>
fib1[39] = 0;
fib2[39] = 1;
printf("Thu Tu Giatri\n");
printf("1 %d\n", fib1[39]);
if (n > 1) {
printf("2 %d\n", fib2[39]);
int k;
for (k = 0; k < 40; k++) {
if (nResult[k] != 0) {
break;
}
}
printf("%-9d", m);
printf("\n");
}
}
}
fib1[39] = 0;
fib2[39] = 1;
printf("\n");
}
int main() {
int n;
printf("Nhap vao so nguyen duong n: ");
scanf("%d", &n);
if (n <= 0) {
printf("Vui long nhap so nguyen duong.\n");
return 1;
}
findLastFibonacci(n, nResult);
return 0;
}