hdu5879Cure(java解法)
来源:互联网 发布:淘宝店铺运营思路 编辑:程序博客网 时间:2024/06/05 12:41
Cure
Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 1133 Accepted Submission(s): 377
Problem Description
Given an integer n , we only want to know the sum of 1/k2 where k from 1 to n .
Input
There are multiple cases.
For each test case, there is a single line, containing a single positive integern .
The input file is at most 1M.
For each test case, there is a single line, containing a single positive integer
The input file is at most 1M.
Output
The required sum, rounded to the fifth digits after the decimal point.
Sample Input
124815
Sample Output
1.000001.250001.423611.527421.58044
Source
2016 ACM/ICPC Asia Regional Qingdao Online
import java.util.Scanner;public class Main {public static void main(String[] args) {// TODO Auto-generated method stubdouble num[] = new double[200000];Scanner cin = new Scanner(System.in);java.text.DecimalFormat df =new java.text.DecimalFormat("#.00000"); num[0] = 0;for(int i=1;i<200000;i++){num[i] = num[i-1]+1.0/i/i;}String str;while(cin.hasNext()){str = cin.nextLine();if(str.length()<=6){int n = 0;for(int i =0 ; i<str.length();i++){n = n*10+(str.charAt(i)-'0');}if(n<=200000){System.out.println(df.format(num[n]));}elseSystem.out.println("1.64493");}elseSystem.out.println("1.64493");}}}
0 0
- hdu5879Cure(java解法)
- 等式变换java解法
- zoj1292大数,Java解法
- leetcode58题---java解法
- NumberOf1 Java解法
- hdu 1950 java解法
- hdu1039 java正则表达式解法
- 八皇后(java递归解法)
- 汉诺塔java递归解法浅析
- poj 2506 Tiling(java解法)
- [蓝桥杯][java]埃及分数解法
- 数独解法Java实现
- Leetcode001:twoSum的Java解法
- 水王问题java解法
- 九连环解法java版
- 第五届蓝桥杯兰顿蚂蚁java解法
- 一道微软算法题的java解法
- JAVA中文问题及最优解法
- Exception starting filter struts2的解决方法
- Matlab中的graythresh函数
- js页面刷新事件 ,Javascript刷新页面的几种方法
- 新闻客户端案例
- 映射多对对关联关系
- hdu5879Cure(java解法)
- 关于多线程情况下的生产者消费者模式的一些记录
- [hdu 5898 odd-even number] 数位DP
- Android使用Application总结
- Codeforces 500B New Year Permutation(更换位置,找最小字典数)
- leetcode 15 3Sum
- Arch linux (虚拟机)安装教程
- HDU 5898 odd-even number (2016亚洲区沈阳站网络赛 )
- Permutations I , II