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

4 votes422 views1 answer
How to print value of pointer in c
C
0 vote439 views8 answers
Convert c program to assembly language online
C
0 vote376 views1 answer
Xor in c
C
0 vote375 views1 answer
Ternary operator in c
C
1 vote379 views1 answer
Grep find and replace
C
0 vote408 views1 answer
Data breach
C
0 vote448 views1 answer
4 byte alignment c code
C
0 vote381 views1 answer
C Operator associativity
C
0 vote450 views2 answers
Pthread_create
C
5 votes385 views1 answer
Array loop in c
C