TCOUNT2 - Counting Triangles II
We define the LEVEL of a triangle as in the following illustrative image:
And we continue defining the LEVEL of a hexagon. It's called level N hexagon if it’s joined by 6 triangles, each one is a level N triangle.
Task: All you have to do is to count all triangles in the “level N” hexagon.
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 hexagon in that test case.
For each test case, you should write a seperate line: the number of triangles in the “level N” hexagon. (All answers will fit within the range of a 64-bit positive integer)
Input: 1 1 Output: 6
(Tjandra Satria Gunawan)(æ›¾æ¯…æ˜†):
I can't see the image too!
Images are broken.. i can't see them.
The result for n=1000000 is correct, the result for n=5555555 is wrong. The correct result doesn't fit into a 64-bit integer.Last edit: 2010-01-28 15:04:40
i,m too getting same answer for (1000000 --> 3500002250000500000) and (5555555 -->