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 vote237 views1 answer
Write a 64-bit program in assembly that prints Hello, world in .asm
C
0 vote197 views1 answer
Tetris rotate shape
C
0 vote209 views1 answer
Ltoa in c
C
0 vote189 views1 answer
Macos prevent disk mounting
C
0 vote202 views1 answer
FIRST PROGRAM IN C
C
0 vote212 views1 answer
Vim soft line break
C
1 vote316 views1 answer
C check if char is an operator
C
22 votes247 views2 answers
How to combine strings in c
C
0 vote197 views2 answers
Params in main function in C
C
0 vote200 views1 answer
Navigate to line intellij
C