TJANDRAS  Tjandra 19th birthday (EASY)
This day (7 February 2013) is my 19th birthday So, I want to celebrate it on SPOJ by making this EASY puzzle problem.
This game/puzzle is about matches, given n matches, your task is to arrange the matches (not necessarily all) such that number of rectangle (any size) is maximum.
Input
First line there is an integer T≤100 then T lines follow, each line contain an integer n<1.000.000.000.
Output
For each test case, output required answer (maximum number of rectangles)
Example
Input:
5
3
4
8
12
15
Output:
0
1
3
9
12
Explanation
>First test case: No rectangle can be formed with only 3 matches
>Second test case: Only one rectangle can be formed with 4 mathes
>Third test case:
there are max 3 rectangles (2 size 1x1, 1 size 2x1) can be formed with number of matches<=8, here is one of the mathes formation:
>Fourth test case:
there are max 9 rectangles (4 size 1x1, 2 size 2x1, 2 size 1x2, 1 size 2x2) can be formed with number of matches <=12, here is one of the formation:
>Fifth test case:
there are max 12 rectangles (5 size 1x1, 3 size 2x1, 1 size 3x1, 2 size 1x2, 1 size 2x2) can be formed with number of matches <=15, here is one of the formation:
Information
Time limit≈150x my program speed, Enjoy this birthday party game, I set this problem such that semi naive solution will pass..
hide comments
champion812r:
20190503 20:40:08
Tjandra can you help me? I dont understand why my code doesnt work. For first 30 numbers it works. 

(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
20140603 20:36:49
@VenkateshP: Your solution isn't optimal, there are better configuration.. 

ybbkrishna:
20140603 10:54:54
GREEN finally :D 

VenkateshP:
20140602 20:53:57
Hi @Tjandra I'm getting Wrong Answer, Can you please check at my submission(id 11692407) 

Mostafa 36a2:
20130601 21:44:02
YESSSS Finally GREEEN green green!! 

Ashish Lavania:
20130531 23:18:14
this problem is humungously tough without paper.... with a pen and paper takes a few minutes. I now truly understand the EASY tag, Tjandra 

Mostafa 36a2:
20130529 15:32:45
Thanks Mitch..


Mitch Schwartz:
20130529 14:48:46
Ok, it sounded like maybe you were questioning the wording of this problem, rather than just suggesting a new related problem.


Mostafa 36a2:
20130529 14:11:14
there is two ways to arrange


Mitch Schwartz:
20130529 09:30:54
I think it's clear from the explanation what we are meant to count, and what kinds of arrangements are allowed. Last edit: 20130529 09:44:20 
Added by:  Tjandra Satria Gunawan 
Date:  20130207 
Time limit:  3.263s 
Source limit:  19000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ASM64 
Resource:  Just Watch This Video! I Uploaded it 1 year ago 