@@ -0,0 +1,491 @@
+import java.io.*;%0Aimport java.util.*;%0Aimport java.text.*;%0Aimport java.math.*;%0Aimport java.util.regex.*;%0A%0Apublic class Solution %7B%0A%0A  private static long cuts(int k) %7B%0A    // idea is to maximize the area that is cut%0A    long area = (k %25 2 == 0) ? k/2 : (k/2 + 1);%0A    return area * (k/2);%0A  %7D%0A%0A  public static void main(String%5B%5D args) %7B%0A    Scanner in = new Scanner(System.in);%0A    int t = in.nextInt();%0A    while (t %3E 0) %7B%0A      System.out.println(cuts(in.nextInt()));%0A      t--;%0A    %7D%0A  %7D%0A%7D%0A

add solution