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 vote182 views1 answer
Unable to locate package dos2unix
C
17 votes226 views1 answer
Fgets c
C
0 vote124 views1 answer
How much larger integer i can input in c language?
C
0 vote165 views1 answer
Powershell some fonts like #include are dissapearing
C
1 vote173 views1 answer
Access denied creating xampp-control.ini
C
0 vote174 views1 answer
Install valet-linux
C
1 vote167 views2 answers
Slack wordpress
C
0 vote163 views1 answer
How to turn off bash
C
0 vote200 views1 answer
Choose random number with weight
C
0 vote162 views2 answers
How to know where segfaut is c
C