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

5 votes256 views2 answers
Malloc int array c
C
2 votes178 views2 answers
How to declare an array of n numbers in c
C
0 vote114 views1 answer
What is stdin fd number
C
0 vote190 views1 answer
Arduino server read
C
1 vote179 views1 answer
Length of string in c
C
0 vote166 views1 answer
Powershell some fonts like #include are dissapearing
C
0 vote157 views1 answer
How to make a check bigger
C
0 vote168 views1 answer
Which library include size_t in C
C
0 vote164 views1 answer
HOW TO ADD FORM IN BOOTSTRAp
C
0 vote177 views1 answer
C hello workld
C