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 vote208 views2 answers
C print
C
1 vote158 views1 answer
Add quantity and add to cart woo
C
27 votes217 views6 answers
Hello world c
C
0 vote249 views1 answer
DrawText() raylib
C
0 vote209 views2 answers
C++ code
C
9 votes214 views1 answer
How to genrate a random number in C
C
0 vote227 views1 answer
How to make an integer value equal to character
C
1 vote213 views1 answer
Does strcat null terminate
C
0 vote199 views1 answer
Create arrya of chars malloc
C
4 votes213 views2 answers
C get time
C