import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner input = new Scanner(System.in);
int T = input.nextInt();
while(T–>0) {
double n = input.nextInt();
double sum = 0;
if(n>150)
n=150; for(double i=1;i<=n;i++ ) {
sum+=Math.pow(-1, i-1)*(1/i);
}
System.out.println(String.format("%.2f", sum));
}
}
}其中算法 sum+=Math.pow(-1, i-1)*(1/i);中的Math.pow(-1, i-1)
是代表-1的·i-1次幂