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 vote268 views2 answers
Yterm urllib.error.HTTPError: HTTP Error 404: Not Found
C
0 vote246 views1 answer
Why do you jerk while falling aslee
C
0 vote250 views1 answer
Terraform fargate cpu
C
1 vote225 views1 answer
Stdio
C
0 vote252 views8 answers
Convert c program to assembly language online
C
0 vote246 views1 answer
Bash sed crop cut file line number
C
3 votes242 views3 answers
Clear screen c
C
0 vote245 views1 answer
Phpmyadmin export some errors have been detected
C
7 votes245 views3 answers
How to reverse a string in c
C
0 vote248 views1 answer
Downgrade chrome to previous stable version in linux
C