![]() |
||||||||||
|
||||||||||
The Mystery of TriangleTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 254 Accepted Submission(s): 86 Problem Description There’re some unresolved problems of triangle so far. For example, whether there’s a three middle integer Helen triangle? It is unable to prove its existence until now; they have not found such a triangle. But I' m sure you can solve this problem. Now, there is an equilateral triangle(等边三角形),each edge is divided into two equal parts. Such as the picture ![]() and if each edge is divided into three equal parts, the triangle becomes ![]() ,now you task is to count the number of triangles, diamonds(菱形), and parallelograms(平行四边形). Input Each line will contain a integer n (1 < n < 2^31 - 1). It means each edge of triangle is divided into n equal parts. Process to the end of input. Output Each test case contains three lines. Print answers % 20091226. Sample Input
Sample Output
Author B.A.C Source | ||||||||||
|