算法入门经典
2-4子序列的和
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
int main()
{
int n;
int m;
double sum = 0;
int j = 1;
while(scanf("%d %d",&n,&m) != EOF && n != 0 && m != 0)
{
long long n1,m1;
n1 = n;m1 = m;
for(int i = n1; i <= m1; ++i)
{
sum = sum + 1.0 / pow(i,2);
//printf("%f",sum);
}
printf("Case %d: %.5f\n", j, sum);
++j;
sum = 0;
}
return 0;
}
注意int和longlong范围