习题2-4 子序列的和(subsequence)

版权声明:欢迎加入快乐划水小白交流群:867657085 https://blog.csdn.net/Alfa_Jin/article/details/78449820
#include <stdio.h>

int main()
{
	int n,m;
	int kase = 0;
	
	while(scanf("%d%d",&n,&m) == 2 && ( n || m ))
	{
		double sum = 0;
		for(int i=n;i<=m;i++){
			sum += (double) 1/i/i;
		}
		printf("Case %d: %.5f\n",++kase,sum);
	}
	
	return 0;
}

欢迎加入快乐小白划水交流群:867657085

猜你喜欢

转载自blog.csdn.net/Alfa_Jin/article/details/78449820
2-4