7-28 monkeys choose King (Joseph problem)

subject ：
A group of monkeys are going to choose a new monkey king . The choice of the new monkey king is ： Give Way N There are only monkeys in a circle , The sequence number from a certain position is 1~N Number . From 1 We'll start counting on the , From 1 To report for duty 3, Where to report 3 That's the monkey who quit the circle , And then from the next monkey next to the same number . And so on and on , The last monkey left is the monkey king . What's the original Monkey King number ？

Input format ：
Enter a positive integer on a line N（≤1000）.

Output format ：
Output the number of monkey king in one line .

sample input ：
11

sample input ：
7

#include<stdio.h>
int main()
{   
   int i,j,k,temp;
   int m[1001];   
   int n;
   scanf("%d",&n);
   for(i=0;i<n;i++)   
   {       
       m[i]=i+1;
   }   
   for(i=n-1;i>=0;i--)
   {       
     for(k=1;k<=3;k++)
        {           
          temp=m[0];           
        for(j=0;j<i;j++)
           {               
              m[j]=m[j+1];           
           }           
           m[i]=temp;   
        }   
    }   
    printf("%d",m[0]);   
    return 0;
}

Method resolution ：
The array subscript
0 1 2 3 4 5 6 7 8 9 10
The original sequence
1 2 3 4 5 6 7 8 9 10 11

New sequence
2 3 4 5 6 7 8 9 10 11 1
3 4 5 6 7 8 9 10 11 1 2
4 5 6 7 8 9 10 11 1 2 3 ——3 That is, the first monkey to quit （ Stay in the array ）.

A new round
5 6 7 8 9 10 11 1 2 4 3
6 7 8 9 10 11 1 2 4 5 3
7 8 9 10 11 1 2 4 5 6 3 ——6 That is, the second monkey to quit .

Continue to cycle , Subscript to the last array 0 The serial number of is the last monkey .

summary ： This topic is the classic Joseph Ring problem , At first I saw that I had no way to start （ Novice programmer ）, Referring to the information on the Internet , There are some clever solutions . Interested partners can refer to . Link address ：https://blog.csdn.net/yanweibujian/article/details/50876631