POJ 3157 And Then There Was One

 约瑟夫环问题（数学方法）
| n个人(编号1...n),先去掉第m个数,然后从m+1个开始报1,
| 报到k的退出,剩下的人继续从1开始报数.求胜利者的编号.

#include<stdio.h>  
#include<string.h> 
#include<math.h>
int main(void){
int n, k, m;
while( scanf("%d%d%d", &n, &k, &m), n || k || m )
{
int i, d, s=0;
for( i=2; i <= n; ++i ) s = (s+k)%i;
k = k%n; if( k == 0 ) k=n;
d = (s+1) + (m-k);
if( d >= 1 && d <= n ) printf("%d\n", d);
else if( d < 1 ) printf("%d\n", n+d);
else if( d > n ) printf("%d\n", d%n);
}
}