Odd Pairs Codechef code Java (ODDPAIRS)

Problem

• Given an integer NN, determine the number of pairs (A, B)(A,B) such that:
• 1<=A,B<=N
• A + B is odd.

Input Format

• The first line of input will contain a single integer TT, denoting the number of test cases.
• Each test case consists of a single integer NN.

Output Format

For each test case, output the number of required pairs.

Constraints

• 1<=T<=100
• 1<=N<=10^9

Input

• 5
• 1
• 2
• 3
• 100
• 199

Output

• 0
• 2
• 4
• 5000
• 19800

/* package codechef; // don't place package name! */ import java.util.*; import java.lang.*; import java.io.*; /* Name of the class has to be "Main" only if the class is public. */ class Codechef { public static void main (String[] args) throws java.lang.Exception { Scanner sc = new Scanner(System.in); int t = sc.nextInt(); while(t>=1 && t<=100) { long n = sc.nextInt(); if(n>=1 && n<=(Math.pow(10, 9))) { if(n==1) { System.out.println("0"); }else if(n%2 == 1) { System.out.println( ((n/2)+1)*(n/2)*2 ); }else { System.out.println( (n/2)*(n/2)*2 ); } } t--; } } }