Revenge

Problem code: ARAN08

All submissions for this problem are available.

The final battle has begun, as the bells toll out the hour of doom for the hacker who dared to challenge us. The air smells sweet with vengeance, as our acts of vendetta break through the crumbling defenses to our bellows of rage and bloodlust. This evil shall be put to an end right now, right here. We will plant a virus into the hacker's own system which will irrecoverably wipe out all information on its disks and on any peripherals connected to it. Our ingenious virus is also capable of generating an EMP through the system hardware and the power supply, which will disable all electronic devices in range. But to make the hardware malfunction and thus emit that EMP, we must direct our virus to attack at prime locations in the system software. These locations can only be traced out observing the response of the system kernel to our commands. You have been given a copy of those responses, and you must decode them as soon as possible. Let's slay this evil together. Revenge smells sweet.

Input:

The first line will consist of the total number of test cases T. Each test case is separated by a new line. The next line will consist of number of inputs N for each test case where 1<=N<=50. The next N lines will consist of the values V for each test case where 1<=V<=50.

Output:

For each test case, output will be in N lines containing a number each. Each output is separated by a new line .

Example:(-----denotes a new line) Input:

4
------
2
1
3
------
4
4
3
5
6
------
5
6
7
8
9
10
------
1
9

Output:

19
1
------
89
149
47
19
------
307
409
523
149
223
------
409

Author: admin
Date Added: 30-09-2009
Time Limit: 5 sec
Source Limit: 50000 Bytes
Languages: ADA, ASM, BASH, BF, C, C99 strict, CAML, CLOJ, CLPS, CPP 4.0.0-8, CPP 4.3.2, CS2, D, F#, FORT, GO, HASK, ICK, ICON, JAR, JAVA, JS, LISP clisp, LISP sbcl, LUA, NEM, NICE, PAS fpc, PAS gpc, PERL, PERL6, PHP, PIKE, PRLG, PYTH, PYTH 3.1.2, RUBY, SCALA, SCM guile, SCM qobi, ST, TEXT, WSPC


Comments

SUCCESSFUL SUBMISSIONS FOR THIS PROBLEM:

HELP

Program should read from standard input and write to standard output. After you submit a solution you can see your results by clicking on the [My Submissions] tab on the problem page. Below are the possible results:

 

  • Accepted Your program ran successfully and gave a correct answer. If there is a score for the problem, this will be displayed in parenthesis next to the checkmark.
  • Time Limit Exceeded Your program was compiled successfully, but it didn't stop before time limit. Try optimizing your approach.
  • Wrong Answer Your program compiled and ran succesfully but the output did not match the expected output.
  • Runtime Error Your code compiled and ran but encountered an error. The most common reasons are using too much memory or dividing by zero. For the specific error codes see the help section.
  • Compilation Error Your code was unable to compile. When you see this icon, click on it for more information.

    • If you are still having problems, see a sample solution here.

CodeChef is a global programming communityCodeChef hosts online programming competitions