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 vote320 views1 answer
Code wars responsable drinker
C
0 vote300 views1 answer
C zero out array
C
-2 votes302 views1 answer
Split string at space C
C
2 votes317 views1 answer
Ln: failed to create symbolic link 'protoc': File exists
C
0 vote291 views1 answer
Mark rober
C
0 vote298 views1 answer
Sieve of eratosthenes c
C
0 vote286 views1 answer
National festivals of india in hindi
C
21 votes311 views6 answers
Material UI install
C
1 vote314 views1 answer
What is the usage of extern in c
C
1 vote311 views1 answer
LINEAR AND BINARY SEARCH
C