70,022
社区成员




#include <stdio.h>
unsigned long test_fibonacci(int n);
int main(void)
{
int n;
printf("Enter a positive integer (q to quit): ");
while(scanf("%d", &n) == 1)
{
printf("\nThe %dth number in the fibonacci numbers is %lu",
n, test_fibonacci(n));
printf("\nEnter a positive integer (q to quit): ");
}
puts("\nDone!");
return 0;
}
unsigned long test_fibonacci(int n)
{
int i, sum = 0;
if(n <= 2)
sum = 1;
else
for(i = 2; i <= n; i++)
{
}
return sum;
}
#include <stdio.h>
unsigned long test_fibonacci(int n);
int main(void)
{
int n;
printf("Enter a positive integer (q to quit): ");
while(scanf("%d", &n) == 1)
{
printf("\nThe %dth number in the fibonacci numbers is %lu",
n, test_fibonacci(n));
printf("\nEnter a positive integer (q to quit): ");
}
puts("\nDone!");
return 0;
}
unsigned long test_fibonacci(int n)
{
int a,b;
a = b = 1;
unsigned long t = 0;
int target;
if (n<=2) {
return (unsigned long)a;
} else {
for (int ind=2;ind<n;ind++) {
t = a+b;
a = b;
b = t;
}
return t;
}
}
#include<stdio.h>
int main()
{
int Fibonacci(int x);
int m,n;
scanf("%d",&m);
for(int i=1;i<=m;i++)
{
scanf("%d",&n);
printf("%d ",Fibonacci(n));
}
return 0;
}
int Fibonacci(int x)
{
if(x==1||x==2)
x=1;
else
x=Fibonacci(x-1)+Fibonacci(x-2);
return x;
}