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 vote136 views1 answer
Cmd command to hide folder
C
1 vote154 views2 answers
Get chunks of a mp4 in ffmpeg
C
1 vote140 views4 answers
Array of strings c
C
0 vote139 views3 answers
C to C++ online Converter
C
0 vote144 views1 answer
Fgets em c
C
3 votes134 views1 answer
Check if string in string c
C
1 vote139 views1 answer
No module named 'vectormath'
C
0 vote159 views1 answer
How to compile and run a program in c
C
1 vote129 views1 answer
How to delete data and add from file in c language
C
0 vote135 views6 answers
Inorder to postorder converter online
C