poj3517数学方法解约瑟环

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
using namespace std;
int n,k,m;
int main()
{
while(scanf("%d %d %d",&n,&k,&m),n||m||k)
{
int ansp,ansn;
ansp = 0;
for(int i = 1; i < n; i++)
{
ansn = (ansp + k)%i;
ansp = ansn;
}
ansn = (ansp+m)%n + 1;
printf("%d\n",ansn);
}
return 0;
}

本文出自 “Qero” 博客，请务必保留此出处http://8590696.blog.51cto.com/8580696/1358914

poj3517数学方法解约瑟环

原文：http://8590696.blog.51cto.com/8580696/1358914