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 votes151 views2 answers
Code to print out entire array in c
C
4 votes149 views3 answers
Strcasecmp c
C
-1 vote183 views2 answers
Open url from dev cpp
C
0 vote91 views2 answers
Liste chainée c
C
0 vote195 views1 answer
Fungetc
C
5 votes178 views4 answers
Div same line
C
1 vote146 views6 answers
Online linux terminal for c programming
C
4 votes152 views1 answer
Best switch game
C
0 vote153 views1 answer
C convert string to size_t
C
4 votes148 views2 answers
ImportError: No module named 'skimage'
C