Wrong answers all

https://ide.codingblocks.com/s/203017.

The logic is if j is possible from i then jumps[j]=min(1+jumps[i],jumps[j]) .

Just put endl at the end. Output should be printed in new line for each testcase.