4.3趣味分数之多项式求和

1.问题描述

2.完整程序

3.递归解决法
//多项式求和
//s =1+1/1x2+1/1X2X3+1/1X2X3X4

double func(double n){
if (n==1) {
return 1;
}else {
return 1/n*func(n-1);
}
}

int main(int argc,char*argv[])
{
int a;
printf(“输入数字:\n”);
scanf(“%d”,&a);
double s=0.0;
for (int i=1; i

<script type="text/javascript"> $(function () { $('pre.prettyprint code').each(function () { var lines = $(this).text().split('\n').length; var $numbering = $('<ul/>').addClass('pre-numbering').hide(); $(this).addClass('has-numbering').parent().append($numbering); for (i = 1; i <= lines; i++) { $numbering.append($('<li/>').text(i)); }; $numbering.fadeIn(1700); }); }); </script>