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 vote123 views1 answer
Prims and kruskal algorithm
C
0 vote138 views7 answers
C++ convert to c online
C
0 vote159 views1 answer
*** AttributeError: module 'cv2.cv2' has no attribute 'drawKeypoints'
C
0 vote133 views2 answers
Can i have a table with strings in c
C
28 votes208 views2 answers
Debian install npm
C
2 votes154 views2 answers
Read string with space c
C
36 votes251 views6 answers
Logging.logger
C
3 votes125 views1 answer
Casting an int to a char in c
C
0 vote133 views1 answer
Bash get load average
C
0 vote138 views1 answer
How to get input in 2d array in c
C