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 vote142 views1 answer
Can we update values of a map via traversing
C
12 votes120 views6 answers
Do-While loop
C
-2 votes120 views1 answer
Remove c
C
11 votes120 views5 answers
C convert char to int
C
1 vote111 views6 answers
Online linux terminal for c programming
C
2 votes67 views2 answers
Swap variables in c
C
0 vote99 views1 answer
Email dev Microsoft Outlook 2007 items all aligned left or aligned wrong
C
0 vote109 views1 answer
Ctest run specific test
C
1 vote108 views1 answer
Unity read text file line by line
C
0 vote111 views10 answers
Php
C