CF932C Permutation Cycle

思路：

构造。

实现：

 #include <bits/stdc++.h>
 using namespace std;
 int res[];
 int main()
 {
     int n, a, b;
     while (cin >> n >> a >> b)
     {
         int maxn = max(a, b), minn = min(a, b);
         bool flg = false;
         int i = ;
         for (; i <= n; i += maxn)
         {
             if ((n - i) % minn == ) { flg = true; break; }
         }
         if (!flg) { cout << - << endl; continue; }
         int x = i / maxn, y = (n - i) / minn;
         int cnt = , last = ;
         for (int i = ; i < x; i++)
         {
             int start = cnt;
             for (int j =  + i * maxn; j <= maxn + i * maxn; j++)
             {
                 res[cnt++] = j;
             }
             int tmp = res[start];
             int j = start;
             for (; j < cnt - ; j++)
             {
                 res[j] = res[j + ];
             }
             res[j] = tmp;
         }
         int fuck = cnt;
         for (int i = ; i < y; i++)
         {
             int start = cnt;
             for (int j = fuck +  + i * minn; j <= fuck + minn + i * minn; j++)
             {
                 res[cnt++] = j;
             }
             int tmp = res[start];
             int j = start;
             for (; j < cnt - ; j++)
             {
                 res[j] = res[j + ];
             }
             res[j] = tmp;
         }
         for (int i = ; i < cnt; i++) cout << res[i] << " ";
         cout << endl;
     }
     return ;
 }