OJ Board

Hi Niaz, Ya, my second output is not correct here. Actually i used int64. Before submitting at uva i change it to long long. I'm just again check the code and replace long long to int64, now in shows the correct output which is -1. So, type casting may be the problem for giving the wrong output for ...

Hi Sarah_S,
Your code produce trailing zero. Just ignore it. Like , for input Correct output should be But ur code generates Hope it helps. Thanks in advance.

HI asif_rahman0,
Did u noticed abt ur time complexity ? n ≤ 500000 and also there are 500000 lines of input. Actually the problem doesnt need array. Its a well known Josephus problem. So it will be helpful if u read those things. Hope it helps. Good Luck.

Hi,
Here is the link abt explanation of 10928. Let me know, If u face problem again after see this page. Good Luck.
http://online-judge.uva.es/board/viewtopic.php?t=9112

Hi Saif, Here is the output for ur input. Hope it helps. Good Luck. -1 99 01 02 00 02 29 68 05 11 07 09 25 65 02 06 11 12 28 43 01 23 05 10 28 -1 96 07 23 39 05 10 10 12 13 65 08 14 69 04 09 58 08 12 42 02 11 36 03 14 05 07 15 49 03 29 06 11 30 02 10 15 22 01 24 41 11 30 01 09 14 24 06 25 83 10 19 1...

Hi mmij,
Your code is ok. U use %lld for taking input but u didnt write this when u print the output ( Last Line). Just replace all %d to %lld. Thanks. Good Luck.

Hi Tan_yui,
Thanks for ur help. I found my mistake and got accepted . Thanks again.

Hi all,
I need some i/o for this problem. I'm getting WA. Please someone provide me some i/o. Thanks in advance.

Hi Antonio Ocampo,
Thanks for ur output. Actually my code was correct and matched with your output, but i missed the case n=0. After i edit then got ACC. Thanks again. Bye and good luck.

Hi all,
Please give me correct outputs for the following inputs. Thanks in advance.

Hi all,
I want to know how i solve this problem by using Hash. Without hashing is it solvable ? Thanks in advance.

Hi all, Though this is one of the very easy problem in the last contest and many ppl solved this problem during the contest, but i think the input description should be clear. Before i solved this problem , i assume that always input will be given by this way(given input), but assuming is not always...

Hi Chok, Sorry 4 very late reply. Here is some i/o(also included the problem i/o) . Verify it. Good Luck. :D Input:- 5 3 0 3 4 1 1 -2 2 -2 0 5 3 1 4 2 -2 5 -3 1 0 2 4 3 0 5 2 3 3 1 2 4 3 1 5 3 3 5 1 3 3 0 0 0 2 2 2 4 5 5 5 10 10 10 10 5 4 1 1 5 1 5 5 1 5 4 3 0 6 3 3 6 0 3 2 Output :- 7 -2.00 1.33 -2...

Hi James, You didnt mention which RTE u get. I dont think that u got SIGFPE(floating point exception), bcoz the problem statement cleary says that "there are no divide-by-zero errors". Most probably segment violation. So, check invalid memory access. For ur kind information, i use num[20] ...

Hi James, I think it'll better if u share your process with us or you can send your code by pm. Another things, in this type of problem, in my opinion, if u writing n'th line code then u must be sure that 1 to n-1 lines are perfect and bug free. I mean for proceed one line u have to sure that upto t...