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 vote109 views1 answer
Bp result system
C
0 vote106 views1 answer
I2c scanner
C
0 vote118 views1 answer
Memset c
C
3 votes108 views1 answer
How to replace a number in an array in the console for c programming
C
17 votes137 views1 answer
Fgets c
C
4 votes107 views2 answers
Create empty vector in rust
C
0 vote115 views1 answer
Levenshtein c
C
1 vote116 views3 answers
String array in c
C
0 vote114 views1 answer
Assets/Scripts/UIManager.cs(65,13): error CS0201: Only assignment, call, increment, decrement, await, and new object expressions can be used as a statement
C
0 vote114 views1 answer
How to fill a triangle in c
C