递归法
//递归版本
#include <stdio.h>
double sum(int N){if(N==1){
return 1.000000;
}else{
return (1.0/N)+sum(N-1);
}
}
int main (){
int N,sign=1;
scanf("%d",&N);
printf("%0.6f",sum(N));
return 0;
}
//非递归解法
#include <stdio.h>
int main (){
int N,sign=1;
scanf("%d",&N);
double deno=2.0,sum=1,term;
while(deno<=N){
term=sign/deno;
sum+=term;
deno+=1;
}
printf("%0.6f\n",sum);
return 0;
}
int main (){
int N,sign=1;
scanf("%d",&N);
double deno=2.0,sum=1,term;
while(deno<=N){
term=sign/deno;
sum+=term;
deno+=1;
}
printf("%0.6f\n",sum);
return 0;
}
腾讯一面1140人在聊
投递腾讯等公司8个岗位 >