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

6 votes184 views2 answers
Invoke-webrequest download file
C
7 votes190 views3 answers
Take array as input in c
C
1 vote174 views1 answer
Dynamically create matrix c
C
0 vote183 views1 answer
C defined value sum
C
0 vote181 views2 answers
Sort linked list C
C
183 votes408 views6 answers
Create new branch git
C
0 vote197 views1 answer
Toggling setting clearing checking changing a bit in c
C
0 vote174 views1 answer
Geom boxplot remove outliers
C
0 vote202 views1 answer
How to change background color in c programming
C
37 votes310 views2 answers
How to && in a while loop on c
C