[数论] BZOJ 1406 [AHOI2007]密码箱

n=ab

a|(x-1) b|(x+1) || a|(x+1) b|(x-1)

#include<cstdio>
#include<cstdlib>
#include<algorithm>
#include<set>
using namespace std;
typedef set<int>::iterator ITER;

set<int> S;
int n;

int main()
{
    scanf("%d",&n);
    if(n==1) return printf("None"),0;
    for(int a=1;a*a<=n;a++) 
		if(n%a==0){
       		int b=n/a;
       		for(int i=1;i<=n;i+=b)   if((i+1)%a==0) S.insert(i);
        	for(int i=b-1;i<=n;i+=b) if((i-1)%a==0) S.insert(i);
    	}
    for (ITER it=S.begin();it!=S.end();it++)
        printf("%d\n",*it);
}