Walk on the Axis
All submissions for this problem are available.
Read problems statements in Mandarin Chinese and Russian as well.
There are N+1 lights. Lights are placed at (0, 0), (1, 0), (2, 0) ... (N, 0). Initially all the lights are on. You want to turn off all of them one after one. You want to follow a special pattern in turning off the lights.
You will start at (0, 0). First, you walk to the right most light that is on, turn it off. Then you walk to the left most light that is on, turn it off. Then again to the right most light that is on and so on. You will stop after turning off all lights. You want to know how much distance you walked in the process. Note that distance between (a,0) and (b,0) is |a-b|.
The first line of the input contains an integer T denoting the number of test cases. Each test case has a single integer N on separate line.
For each test case, output the distance you walked.
- 1 ≤ T ≤ 10^5
- 1 ≤ N ≤ 10^5
Input 2 1 2 Output 2 5
Testcase #2 You are initially at (0, 0) Right most on-light is (2, 0). Distance = 2. Now you are at (2, 0). Left most on-light is (0, 0). Distance = 2. Now you are at (0, 0) Right most on-light is (1, 0). Distance = 1. Now you are at (1, 0) and all lights are turned off. Total distance walked = 5.
|Tags||ad-hoc, anudeep2011, cakewalk, cook51|
|Time Limit:||1 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6, CS2, PAS fpc, PAS gpc, RUBY, PHP, GO, NODEJS, HASK, SCALA, D, PERL, FORT, WSPC, ADA, CAML, ICK, BF, ASM, CLPS, PRLG, ICON, SCM qobi, PIKE, ST, NICE, LUA, BASH, NEM, LISP sbcl, LISP clisp, SCM guile, JS, ERL, TCL, PERL6, TEXT, PYP3, CLOJ, FS|
Fetching successful submissions
If you are still having problems, see a sample solution here.