[AHOI2007]密码箱

题目：
https://ac.nowcoder.com/acm/problem/19877
给定一个$n$，求出所有$x$，满足$x^2\equiv 1(modn)n\le 2\ast 10^9$

思路：
$$\begin{array}{rl}{x}^2& \equiv 1(modn)\\ (x+1)(x-1)& \equiv 0(modn)\end{array}$$
则存在$y$，使得$(x-1)(x+1)=ny$
令$y=y_1\times y_2,n=n_1\times n_2$，因此$y_1\times n_1\times y_2\times n_2=(x-1)(x+1)$，所以我们可以得到$y_1\times n_1=(x-1),y_2\times n_2=(x+1)$（因为$x-1$一部分来自$n$，一部分来自$y$，同理$x+1$)
所以我们可以直接在$\sqrt{n}$的时间内枚举$n_1,n_2$，然后暴力枚举$y_2$，判断$y_1$是否存在

/*program from Wolfycz*/
#include<set>
#include<cmath>
#include<cstdio>
#include<vector>
#include<cstring>
#include<iostream>
#include<algorithm>
#define inf 0x7f7f7f7f
using namespace std;
typedef long long ll;
typedef unsigned int ui;
typedef unsigned long long ull;
inline char gc(){
	static char buf[1000000],*p1=buf,*p2=buf;
	return p1==p2&&(p2=(p1=buf)+fread(buf,1,1000000,stdin),p1==p2)?EOF:*p1++;
}
inline int frd(){
	int x=0,f=1; char ch=gc();
	for (;ch<'0'||ch>'9';ch=gc())	if (ch=='-')	f=-1;
	for (;ch>='0'&&ch<='9';ch=gc())	x=(x<<3)+(x<<1)+ch-'0';
	return x*f;
}
inline int read(){
	int x=0,f=1; char ch=getchar();
	for (;ch<'0'||ch>'9';ch=getchar())	if (ch=='-')	f=-1;
	for (;ch>='0'&&ch<='9';ch=getchar())	x=(x<<3)+(x<<1)+ch-'0';
	return x*f;
}
inline void print(int x){
	if (x<0)	putchar('-'),x=-x;
	if (x>9)	print(x/10);
	putchar(x%10+'0');
}
int n;
set<int>st;
void work(int a,int b){
	for (int i=1;1ll*i*b<=n;i++){//上界无所谓，反正答案取模
		if ((i*b+2)%a==0)	st.insert((i*b+1)%n);
		if ((i*b-2)%a==0)	st.insert((i*b-1)%n);
	}
}
int main(){
	n=read();
	for (int i=1;i*i<=n;i++){
		if (n%i)	continue;
		work(i,n/i);
	}
	for (set<int>::iterator it=st.begin();it!=st.end();it++)	printf("%d\n",*it);
}