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 vote88 views2 answers
Boom miners zerg
C
0 vote97 views1 answer
What is wrong with this in c
C
8 votes104 views6 answers
Error: src refspec main does not match any error: failed to push some refs to
C
2 votes81 views2 answers
How to delete virtual hard disk virtualbox
C
2 votes82 views1 answer
How to include math library in c
C
0 vote82 views1 answer
Epoch time in c
C
35 votes181 views5 answers
Online github copilot
C
21 votes104 views6 answers
Mkv to mp4
C
0 vote42 views1 answer
Redis as a service
C
1 vote90 views1 answer
Length of string in c
C