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 vote392 views1 answer
How to fill a triangle in c
C
0 vote424 views1 answer
Mosquitto MQTT client arguments
C
1 vote382 views1 answer
C printf to string
C
0 vote473 views2 answers
Cannot convert from 'int' to 'string' [Api]
C
0 vote381 views1 answer
Maatwebsite/excel file import
C
0 vote424 views1 answer
Wait until an animation finishes - Selenium, Java
C
3 votes375 views1 answer
'int' is not a subtype of type 'double' dart
C
1 vote379 views1 answer
Printf fill with 0
C
0 vote400 views1 answer
Jframe mittig positionieren
C
0 vote411 views1 answer
Rust cross compile
C