And Then There Was One(约瑟夫环)

https://icpcarchive.ecs.baylor.edu/index.php?option=com_onlinejudge&Itemid=8&page=show_problem&problem=1883

题意:给3个整数 n,k,m (2 ≤ n ≤ 10000, 1 ≤ k ≤ 10000, 1 ≤ m ≤ n)

代表，n个人围成一个圈，编号1-n 先删除m号，然后从m+1开始数，每 k 个删一次，然后就一直重复，问最后一个是几号

典型的约瑟夫环问题，递推

 #include<iostream>
 #include<stdio.h>
 using namespace std;

 int main()
 {
     int n,m,k;
     while (scanf("%d%d%d",&n,&k,&m)&&(n||m||k))
     {
         int s = ;
         for (int i=;i<=n-;i++)
             s = (s+k)%i;
         s = (s+m)%n;
         printf("%d\n",s+);
     }
     return ;
 }