uva 1394

简单的dp问题，百度百科有对约瑟夫环的解释！理解了就行

#include <iostream>#include <cstdio>#include <cmath>#include <cstdlib>#include <iomanip>#include <algorithm>#include <cctype>#include <stack>#include <queue>#include <string>#include <cstring>#include <iomanip>#include <set>#include <vector>#include <cstdio>#include <stack>#include <sstream>#include <cstring>#include <map>using namespace std;#define TESTint dp[10005];int main(){  /* #ifdef TEST   freopen("C:\\Users\\MrZis\\Desktop\\input.txt","r",stdin);   freopen("C:\\Users\\MrZis\\Desktop\\output.txt","w",stdout);   #endif*/   int n,k,m;   while(scanf("%d%d%d",&n,&k,&m)&&n)   {    memset(dp,0,sizeof(dp));    for(int i=2;i<n;i++)        dp[i]=(dp[i-1]+k)%i;    dp[n]=(dp[n-1]+m)%n;    printf("%d\n",dp[n]+1);   }   return 0;}