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

3 votes124 views2 answers
Uuidv4 javascript
C
1 vote130 views1 answer
Dynamically create matrix c
C
0 vote139 views1 answer
C include delay
C
0 vote142 views1 answer
Siteorigin shortcodes
C
0 vote80 views1 answer
Postgres random choice
C
8 votes140 views1 answer
Syntax To Take Input In C
C
0 vote140 views1 answer
Bootsrap textbox
C
0 vote143 views1 answer
Arduino vscode upload choosing sketch
C
0 vote148 views2 answers
Time include c
C
0 vote134 views1 answer
Increment & Decrement Operator in C language
C