题目如下 《算法竞赛入门经典》习题2-8 子序列的和(subsequence)_Carry lsh的博客-CSDN博客
#include <cstdio>
int n, m, k;
int main(){
k = 0;
while(scanf("%d %d", &n, &m) && n && m){
double ans = 0;
for(; n <= m; ++n){
ans += 1.0 / n / n;
}
printf("Case %d: %.5f\n", ++k, ans);
}
return 0;
}