[AHOI2007]密码箱 数论

Description
给你一个数n，要你求出所有满足条件的x小于n，并且x^2 mod n = 1。

---

Sample Input
12

---

Sample Output
1
5
7
11

---

首先化一下式子就变成了这样：
(x-1)(x+1) - nk = 0
设：x-1=n1k1，
x+1=n2k2
那么你就可以枚举n的因子然后再暴力枚举k即可。。。

---

#include <set>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <algorithm>

#define It set<int>::iterator
using namespace std;
typedef long long LL;
int _min(int x, int y) {return x < y ? x : y;}
int _max(int x, int y) {return x > y ? x : y;}
int read() {
	int s = 0, f = 1; char ch = getchar();
	while(ch < '0' || ch > '9') {if(ch == '-') f = -1; ch = getchar();}
	while(ch >= '0' && ch <= '9') s = s * 10 + ch - '0', ch = getchar();
	return s * f;
}

set<int> s;

int main() {
	int n = read();
	for(int i = 1; i <= sqrt(n); i++) if(n % i == 0){
		LL h1 = n / i, h2 = i;
		for(LL j = 0; j <= n; j += h1) {
			if(j + 1 < n && (j + 2) % h2 == 0) s.insert(j + 1);
			if(j - 1 > 0 && (j - 2) % h2 == 0) s.insert(j - 1);
		}
	} if(s.empty()) printf("None\n");
	else {
		for(It it = s.begin(); it != s.end(); ++it) printf("%d\n", *it);
	}
	return 0;
}