Alex is attending a Halloween party with his girlfriend Silvia. At the party, Silvia spots a giant chocolate bar. If the chocolate can be served as only 1 x 1 sized pieces and Alex can cut the chocolate bar exactly K times, what is the maximum number of chocolate pieces Alex can cut and give Silvia?

Input Format
The first line contains an integer T, the number of test cases. T lines follow.
Each line contains an integer K

Output Format
T lines. Each line contains an integer that denotes the maximum number of pieces that can be obtained for each test case.

Constraints
1<=T<=10
2<=K<=10⁷

Note
Chocolate needed to be served in size of 1 x 1 size pieces.
Alex can‘t relocate any of the pieces, nor can he place any piece on top of other.

题解：坑在输入范围上了，答案要用long型。

代码：

 1 import java.io.*; 2 import java.util.*; 3 import java.text.*; 4 import java.math.*; 5 import java.util.regex.*; 6  7 public class Solution { 8    static long Halloween_party(long k){ 9        if(k %2 ==0)10            return (k/2)*(k/2);11        return (k/2)*(k/2+1);12    }13 14  public static void main(String[] args) {15      Scanner in = new Scanner(System.in);16      int t = in.nextInt();17      for(int i = 0;i < t;i++){18          long k = in.nextInt();19          System.out.println(Halloween_party(k));20      }21 22      23    }24 }