约瑟夫 猴子选大王

猴子选大王，通过简单模拟可以解决。思路是踢掉n-1,只剩最后一个

#include <stdio.h>#include <stdlib.h>#include <string.h>#include <memory.h>#define ALIVE 1#define DIE   0int get_monkey_king(int monkey[],int num,int ith){int index = 0; for(int i=0; i<num-1; i++)//踢掉num-1个{for(int cnt=0; cnt<ith; ){if(monkey[index] == ALIVE){//index = (index++)%num;/*这个是错的，这个会index%num,然后再加1*/index = (++index)%num;cnt++;}elseindex = (++index)%num;}monkey[(index-1+num)%num] = DIE;}for(int i=0; i<num; i++){if(monkey[i] == ALIVE)return i+1;}return -1;}int main(){int n,m;scanf("%d",&n);scanf("%d",&m);int monkey[10];  //变长数组//memset(monkey,1,sizeof(int)*10); //为什么无效的？原因是他把每个字节赋值为1for(int i=0; i<n; i++)monkey[i] = 1;//printf("%d\n",monkey[i]);int ith = get_monkey_king(monkey,n,m);if(ith == -1)printf("输入无效\n");elseprintf("%d\n",ith);return 0;}