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

39 votes467 views4 answers
Scp file
C
4 votes312 views2 answers
Responsive form bootstrap 4
C
2 votes312 views2 answers
Find only list directories
C
0 vote314 views1 answer
C string equil
C
0 vote324 views1 answer
Regex to match any character being repeated more than 10 times
C
2 votes330 views2 answers
Joins in update query
C
5 votes315 views1 answer
Matplotlib plot line style
C
33 votes406 views10 answers
Chat
C
0 vote329 views2 answers
#0000ff
C
2 votes316 views1 answer
C union in struct
C