习题2-4 子序列的和(subsequence)
2017-11-05 15:33
218 查看
#include <stdio.h> int main() { int n,m; int kase = 0; while(scanf("%d%d",&n,&m) == 2 && ( n || m )) { double num; double sum = 0; for(int i=n;i<=m;i++){ num = (double) 1/i/i; sum = num + sum; } printf("Case %d: %.5f\n",++kase,sum); } return 0; }
相关文章推荐
- 算法竞赛入门经典 习题2-8 子序列的和(subsequence)
- 《算法竞赛入门经典》习题2-8 子序列的和(subsequence)
- 习题2-4 子序列的和(subsequence)
- 习题2-4 子序列的和(subsequence)
- 算法竞赛入门经典习题2-4 子序列的和(subsequence)
- [作业]习题2-4 子序列的和(subsequence)
- 习题2-4 子序列的和(subsequence)(java版本)
- Longest Ordered Subsequence【POJ 2533 dp 最长不降子序列】
- 习题2-4 子序列之和
- 最长上升子序列 (Longest Increasing Subsequence, 常简称为 LIS)
- 求出最长非降子序列的长度--LIS:longest increasing subsequence
- Longest Ordered Subsequence dp+POJ+最长升子序列的问题
- 习题2.4 递增的整数序列链表的插入
- POJ 1458:Common Subsequence【最长子序列】
- [LeetCode] Longest Continuous Increasing Subsequence 最长连续递增序列
- poj1458 Common Subsequence 最长公共序列 解题报告(附详细分析)
- poj 2533 Longest Ordered Subsequence (最长子序列)
- Common Subsequence(公共子序列个数)
- LeetCode-594. Longest Harmonious Subsequence (JAVA)最长和谐子序列
- 算法竞赛入门-习题3-9 子序列(All in All, UVa 10340)