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

4 votes337 views1 answer
C minor diminished
C
5 votes369 views2 answers
Macros in c
C
0 vote377 views2 answers
Memory layout in c
C
2 votes314 views2 answers
Swap variables in c
C
2 votes333 views1 answer
Mirzapur 2
C
2 votes332 views1 answer
Terminal size in c
C
0 vote344 views3 answers
If
C
-1 vote358 views1 answer
Matrix of string in c
C
0 vote340 views2 answers
Fgets remove newline
C
0 vote370 views1 answer
Write array of char to file in c
C