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

8 votes143 views1 answer
Syntax To Take Input In C
C
0 vote132 views1 answer
Macos prevent disk mounting
C
7 votes173 views2 answers
Reverse a number in c
C
0 vote161 views1 answer
D3 box shadow
C
0 vote136 views1 answer
Pendu langage c
C
0 vote134 views1 answer
Set all pins as output for loop
C
0 vote142 views1 answer
C language float user input
C
2 votes139 views2 answers
Json reading in php with key
C
4 votes136 views1 answer
Prime chec kin c
C
3 votes170 views4 answers
Install gnome tweaks ubuntu 20.04
C