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

1 vote353 views1 answer
C iterate string
C
0 vote360 views1 answer
OpenDaylight maven settings
C
1 vote370 views1 answer
Why do you need the return 0 c
C
1 vote393 views2 answers
Define constant c
C
0 vote354 views1 answer
Rust unit test display
C
5 votes361 views1 answer
Https://www.codegrepper.com/search.php?q=convert%20string%20to%20float%20c
C
1 vote359 views1 answer
Operators priority in c
C
1 vote351 views1 answer
Stop Redis in Ubuntu WSL
C
0 vote366 views2 answers
Matrix multiplication in c
C
0 vote350 views1 answer
I2c scanner
C