Lmkmaksmxkmakkxxamkskaamkamkaxsmkasm

1. You are given two numbers N and K.2. N represents the total number of soldiers standing in a circle having position marked from 0 to N-1.3. A cruel king wants to execute them but in a different way.4. He starts executing soldiers from 0th position and proceeds around the circle in clockwise direction.5. In each step, k-1 soldiers are skipped and the k-th soldier is executed.6. The elimination proceeds around the circle (which is becoming smaller and smaller as the executed soldiers are removed), until only the last soldier remains, who is given freedom.7. You have to find the position of that lucky soldier.Note -> Check out the question video and write the recursive code as it is intended without  changing signature. The judge can't force you but intends you to teach a concept.

Source: pepcoding.com

Similar codes

0 vote376 views1 answer
Injection
C
0 vote346 views1 answer
Largest value in u32
C
2 votes365 views5 answers
Pointer in C
C
0 vote353 views1 answer
Fscanf stops at space
C
54 votes487 views3 answers
Express post
C
1 vote326 views1 answer
Show image in matplotlib
C
1 vote351 views1 answer
Install kubernetes kubectl on mac
C
1 vote348 views1 answer
How to auto run something on cmd
C
-1 vote350 views1 answer
Time now c
C
1 vote408 views3 answers
Ruby inject
C