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 vote161 views1 answer
C percentage program
C
0 vote163 views1 answer
Terraform fargate cpu
C
3 votes166 views1 answer
C print sizeof char
C
0 vote158 views1 answer
Ubuntu get to local disk
C
2 votes168 views1 answer
Unity 2d movement and animation
C
0 vote186 views1 answer
Code: 'EADDRINUSE', [0] errno: 'EADDRINUSE', [0] syscall: 'listen', [0] address: '::', [0] port: 5000
C
2 votes159 views1 answer
Typedef vs #define
C
5 votes169 views2 answers
C malloc array
C
-2 votes156 views2 answers
Double pointers in c
C
0 vote166 views1 answer
C question mark
C