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 vote243 views1 answer
How to take blank space in c scanf
C
1 vote204 views1 answer
How to mutex lock in c
C
0 vote204 views1 answer
Writing structures in c
C
0 vote257 views1 answer
Unconstrained box flutter
C
0 vote218 views1 answer
Wpdb add temporary while drop table
C
0 vote220 views3 answers
Chevront de vlavier
C
18 votes213 views6 answers
How to check disk space in linux
C
4 votes219 views3 answers
C program to print the multiplication table
C
11 votes227 views5 answers
C convert char to int
C
0 vote224 views2 answers
Struct main function c in unix
C