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 vote161 views1 answer
Access denied creating xampp-control.ini
C
0 vote151 views1 answer
Rainmaker simple project
C
1 vote157 views1 answer
Thread in c
C
0 vote157 views1 answer
Obby übersetzung
C
0 vote152 views1 answer
Recursion c prime number
C
1 vote159 views2 answers
Arduino wifi ip address to string
C
0 vote158 views1 answer
Get range of values in mongodb
C
0 vote150 views1 answer
Arma 3 get group size
C
17 votes146 views6 answers
Array in c
C
3 votes152 views1 answer
C remove last character from a string
C