|
多项式求和 Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) Problem Description 多项式的描述如下:
Input 输入数据由2行组成,首先是一个正整数m(m<100),表示测试实例的个数,第二行包含m个正整数,对于每一个整数(不妨设为n,n<1000),求该多项式的前n项的和。
Output 对于每个测试实例n,要求输出多项式前n项的和。每个测试实例的输出占一行,结果保留2位小数。
Sample Input 2 1 2
Sample Output 1.00 0.50
Author lcy
Source
Recommend JGShining | We have carefully selected several similar problems for you: 2000 1008 2081 2510 2509
|
源代码:
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
sc.nextLine();
while (n-- > 0) {
int m = sc.nextInt();
double sum = 0;
for (int i = 2; i <= m; i++) {
double temp = 1.0 / i;
if (i % 2 == 0) {
temp = -temp;
}
sum += temp;
}
System.out.printf("%.2f", sum+1);
System.out.println();
}
}
}