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

25 votes441 views10 answers
Bootstrap
C
0 vote413 views1 answer
Best approach c menu terminal
C
-1 vote397 views2 answers
Char in c
C
4 votes395 views3 answers
Multiplication table in c using array
C
1 vote387 views1 answer
Divide and conquer program in c
C
0 vote421 views1 answer
How to free memory in c
C
0 vote379 views1 answer
Asasz
C
9 votes426 views9 answers
Selection sort
C
0 vote406 views1 answer
Sum average min max in c array
C
0 vote377 views1 answer
Enregistrement en c
C