JavaElab/AlexBirthday.java at main · jaiganesh21/JavaElab · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
//Q. 38:
//AlexBirthday(Arrays)
/*
Alex is attending a Halloween party with his girlfriend, Silvia. At the party, Silvia spots the corner of an infinite chocolate bar (two dimensional, infinitely long in width and length).
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 should contain an integer that denotes the maximum number of pieces that can be obtained for each test case.
Constraints
1<=T<=10
2<=K<=107
Note: Chocolate must be served in 1 x 1 sized pieces. Alex can't relocate any of the pieces, nor can he place any piece on top of another.
Explanation
The explanation below is for the first two test cases. The rest of them follow a similar logic.
For the first test-case where K=5, you need 3 horizontal and 2 vertical cuts.
For the second test case, where K=6, you need 3 horizontal and 3 vertical cuts.
*/

import java.io.*;
import java.util.Scanner;
public class TestClass {
	 public static void main(String[] args) {

       Scanner sc = new Scanner(System.in);
       int T = sc.nextInt();
       int k,mid,diff;

       while(T>0){

         k = sc.nextInt();
         mid = k/2;
         if (k % 2 == 0)
           System.out.println(mid*mid);
         else {
          diff = k - mid;
          System.out.println(diff*mid);
         }

        T--;
       }

	}
}