parent
df3b994722
commit
ad0edd63c5
@ -0,0 +1,18 @@
|
||||
//斐波拉契和//求第几项之和
|
||||
#include<stdio.h>
|
||||
int Fibon1(int n){
|
||||
if (n == 1 || n == 2) {
|
||||
return 1;
|
||||
} else {
|
||||
return Fibon1(n - 1) + Fibon1(n - 2);
|
||||
}
|
||||
}
|
||||
int main(){
|
||||
int n = 0;
|
||||
int sum = 0;
|
||||
scanf("%d", &n);
|
||||
for(int i=1;i<n;i++){
|
||||
sum+=Fibon1(i);
|
||||
}
|
||||
printf("%d",sum);
|
||||
}
|
||||
Loading…
Reference in new issue