2302.cpp

这是哈尔滨工业大学acmOJ的源代码

/*  This Code is Submitted by wywcgs for Problem 2302 on 2006-08-03 at 22:40:56 */ 
#include <cstdio>

typedef long long int64;

int64 a, b;
int n;

inline int next(int k) { return (a*k%n*k+b)%n; }

int main()
{
	while(scanf("%d %I64d %I64d", &n, &a, &b) != EOF && n != 0) {
		int p1 = 0, p2 = 0, k = 0;
		do {
			p1 = next(p1);
			p2 = next(next(p2));
		} while(p1 != p2);
		do { p1 = next(p1); k++; }
		while(p1 != p2);
		printf("%d\n", n-k);
	}
	
	return 0;
}