CRDS - Cards
Maricruz have a lot of cards, she always uses her cards to build pyramids as shown in the following image:
A pyramid card of 3 levels. She always wonder how many cards does she need to make a pyramid card of N levels. Your task is to answer that question.
Input
The first line of the input contains an integer 1 <= T <= 1,000. Each of the following T lines will have an integer 1 <= N <= 1,000,000.
Output
For each case, output a single line consisting of the number of cards needed to build a pyramid card of level N modulo 1,000,007.
Example
Input Example 2 3 7 Output Example 15 77
hide comments
karan:
2014-10-12 17:38:35
:D |
|
Amit Doshi:
2014-05-22 18:17:26
An easy problem which I managed to screw, owing to blank spaces.
|
|
Francky:
2014-05-14 14:43:24
Image inserted in description. |
|
shyam vinay:
2014-05-13 05:00:50
Note, there's an extra blank line after reading in T value. It costed me 2 WAs. |
|
SHIVAM DIXIT:
2014-04-29 08:35:40
http://cf.ltkcdn.net/boardgames/images/std/50408-283x424-Card_pyramid.jpg
|
|
sarelfeniel:
2014-01-23 08:34:57
Here is the image from KP on a previous page.
|
|
Ankit Jain:
2014-01-14 17:12:17
very easy.....:) |
|
xx_xx:
2014-01-14 08:27:22
after 2 times get TLE. nice problem.. :) |
|
Manit Gupta:
2013-12-24 11:17:03
shortest code ever. ;) Last edit: 2013-12-24 11:17:15 |
|
Ruchir Sharma:
2013-11-11 18:54:49
I am not able to see the image.. Where is the image ?
|
Added by: | Paulo Costa |
Date: | 2012-01-30 |
Time limit: | 1s |
Source limit: | 50000B |
Memory limit: | 1536MB |
Cluster: | Cube (Intel G860) |
Languages: | All except: ASM64 |
Resource: | UGTO |