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

1 vote189 views1 answer
Directory folders structure show windows 10 command prompt
C
0 vote210 views2 answers
Greatest common divisor iterative
C
3 votes193 views2 answers
Gcc compiler for windows 10
C
4 votes206 views4 answers
Multiplication table in c
C
25 votes220 views3 answers
Int to char in c
C
0 vote190 views1 answer
C atoi atof
C
0 vote142 views1 answer
Signal handler in c
C
1 vote162 views1 answer
Incompatible pointer types passing 'string *' (aka 'char **') to parameter of type 'const char *'; dereference with * [-werror,-wincompatible-pointer-types]
C
0 vote186 views1 answer
How to make a multiline string in C
C
0 vote195 views1 answer
Arduino analogwrite
C