《算法竞赛入门经典2th》 习题 2-4 子序列的和

#include <stdio.h>
int main (void)
{
	int n = 0, m = 0, kase = 0;
	while((2 == scanf("%d%d", &n, &m))&&(n||m))
	{
		double sum = 0;
		for (double i = n; i <= m; i++)
		{
			sum +=(1/i)*(1/i);
		}
		printf("case %d: %.5lf\n", ++kase, sum);
	}
	
	return 0;
 } #include <stdio.h>
int main (void)
{
	int n = 0