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 vote310 views1 answer
Passing FILE as argument in c
C
0 vote342 views2 answers
Profile time bash script
C
1 vote312 views1 answer
Grep find and replace
C
0 vote333 views2 answers
Man strstr
C
0 vote651 views1 answer
Code: 'EADDRINUSE', [0] errno: 'EADDRINUSE', [0] syscall: 'listen', [0] address: '::', [0] port: 5000
C
0 vote354 views1 answer
Unconstrained box flutter
C
0 vote297 views1 answer
UTC offset upper limit
C
0 vote347 views1 answer
Identifier bool is undefined in c
C
2 votes310 views2 answers
Json reading in php with key
C
3 votes295 views1 answer
Fast inverse square root explained
C