6388. Next power of 2; Problem code: POWEROF2

[Nebelhom]

Hi guys,

this is the first time, I am doing one of SPOJ's problems and I am feeling a little thick at the moment. I know my code works and it gives me the right answers, but for some reason test engine rejects it (Wrong answer).

I am not looking for optimisations or the like, I would just like to have a hint, what I have to do, so that my (in my opinion) correct answers are accepted From the way the question is phrased (see below for cross-reference), it isn't clear to me, if I have to provide a random number to test or whether during the test I have to provide input fields for test numbers to be inserted.

Here is the question:

For gven integer n print next power of 2 greater than n.
Input

The first line of the standard input contains one integer t (t<10001) which is the number of test cases.

In each of the next t lines there is an integer n (0<=n<=10^9).
Output

For each test, print the next power of 2 greater than n.
Example

Input:
5
5
4
10
16
100
Output:
8
8
16
32
128

and here's my code (again just want a working code before attempting any sort of optimisations; This one is with providing raw inputs for testing):

Code removed

Any hints are appreciated. Thanks folks.

[gorlum0_sof]

Some reason, really? Remove debug printing.

upd. See you got it by yourself.

[Nebelhom]

Only with a little hint by the man who set the question

In the end, it was as stupid. I printed the input again which is not necessary... I'll remove my code so that everyone else can have as much fun

Thanks for your help, anyhow