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 vote107 views1 answer
Parcourire tableau c
C
0 vote136 views1 answer
D3 box shadow
C
3 votes104 views3 answers
For loop vue
C
1 vote111 views1 answer
Reset style matplotlib
C
0 vote134 views1 answer
WARNING: QA Issue: bgslibrary-dev rdepends on libopencv-imgproc, but it isn't a build dependency, missing opencv in DEPENDS or PACKAGECONFIG? [build-deps]
C
2 votes122 views1 answer
How to beautify code in intellij
C
0 vote123 views1 answer
Houdini vex loop over points
C
10 votes120 views2 answers
Malloc c include
C
0 vote109 views1 answer
Flip exis in dataframe
C
18 votes128 views6 answers
How to check disk space in linux
C