BZOJ1406: [AHOI2007]密码箱

 1 #include<cstdio>
 2 
 3 #include<cstdlib>
 4 
 5 #include<cmath>
 6 
 7 #include<cstring>
 8 
 9 #include<algorithm>
10 
11 #include<iostream>
12 
13 #include<vector>
14 
15 #include<map>
16 
17 #include<set>
18 
19 #include<queue>
20 
21 #include<string>
22 
23 #define inf 1000000000
24 
25 #define maxn 500+100
26 
27 #define maxm 500+100
28 
29 #define eps 1e-10
30 
31 #define ll long long
32 
33 #define pa pair<int,int>
34 
35 #define for0(i,n) for(int i=0;i<=(n);i++)
36 
37 #define for1(i,n) for(int i=1;i<=(n);i++)
38 
39 #define for2(i,x,y) for(int i=(x);i<=(y);i++)
40 
41 #define for3(i,x,y) for(int i=(x);i>=(y);i--)
42 
43 #define mod 1000000007
44 
45 using namespace std;
46 
47 inline ll read()
48 
49 {
50 
51     ll x=0,f=1;char ch=getchar();
52 
53     while(ch<‘0‘||ch>‘9‘){if(ch==‘-‘)f=-1;ch=getchar();}
54 
55     while(ch>=‘0‘&&ch<=‘9‘){x=10*x+ch-‘0‘;ch=getchar();}
56 
57     return x*f;
58 
59 }
60 set<ll> s;
61 
62 int main()
63 
64 {
65 
66     freopen("input.txt","r",stdin);
67 
68     freopen("output.txt","w",stdout);
69 
70     ll n=read(),m=(ll)sqrt(n);
71     for(int a=1;a<=m;a++)
72         if(n%a==0)
73         {
74             int b=n/a;
75             for(int x=1;x<=n;x+=b)
76                 if((x+1)%a==0)
77                     s.insert(x);
78             for(int x=b-1;x<=n;x+=b)
79                 if((x-1)%a==0)
80                     s.insert(x);
81         }
82     while(!s.empty())
83     {
84      printf("%lld\n",*s.begin());
85      s.erase(s.begin());
86     }
87 
88     return 0;
89 
90 }