TCOUNT3 - Counting Triangles III
Have you felt bored when counting triangles?
Like TRICOUNT and TCOUNT2, we define the LEVEL of a triangle as in the following illustrative image:
And now we will continue defining the LEVEL of a hexagram. It's called level N hexagram if it’s joined by 12 triangles, each one is a level N triangle.
Task: All you have to do is to count all triangles in the level N hexagram.
The first line of the input contains an integer T - the number of test cases and T lines follow. Each line contains an integer N which is the level of the hexagram in that test case.
For each test case, you should write a seperate line: the number of triangles in the level N hexagram. (All answers will fit within the range of a 64-bit positive integer)
Input: 1 1 Output: 20
Cannot see the picture .. :(
ok got ac with c++ but py2.7 gives tle :(Last edit: 2013-07-13 16:15:04
Reborn In Fire...:
when there are such strict limits on size, atleast give some hints!!!!