SquareProblem code: TECH07 |
You are given a square with 'n' points on each side of the square. None of these points co-incide with the corners of this square. You have to compute the total number of triangles that can be formed using these '4n' points (n points on each side of the square) as vertices of the triangle.
Input
First line contains the integer 'T', the number of test cases. This is followed by 'T' lines with a single integer 'n' on each line n <= 100.
Output
The total number of triangles that can be formed.
Example
Input: 1 1 Output: 4
| Author: | technovanza10 |
| Date Added: | 13-01-2010 |
| Time Limit: | 2 sec |
| Source Limit: | 50000 Bytes |
| Languages: | C, C99 strict, CLOJ, CPP 4.0.0-8, CPP 4.3.2, F#, GO, JAVA, PERL6, PYTH 3.1.2, TEXT |
Comments

Fetching successful submissions

plaese give another input
plaese give another input example
The given sample case is
The given sample case is sufficient to understand the problem statement.
algoCrack, Technovanza10I
algoCrack, Technovanza10
I didnt register on codechef as algoCrack_{teamname} but have
registerd on ur site as {teamname} , can i do something now , if yes
please tell me.....
i'm having 3rd place in ur contest handle vish ( vikas )