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 votes200 views2 answers
C substring
C
8 votes250 views2 answers
How to print boolean in c
C
0 vote201 views1 answer
Android studio sdkmanager always accept
C
1 vote208 views1 answer
Grepper vscodium
C
0 vote210 views1 answer
Reset a console line cpp
C
0 vote221 views1 answer
Hgggggggggggggggg
C
0 vote214 views1 answer
C ausgabe
C
0 vote205 views1 answer
Which library include size_t in C
C
0 vote192 views1 answer
Warning: function returns address of local variable [-Wreturn-local-addr]
C
0 vote194 views1 answer
Area of a right angle triangle
C