uva-11129-分治

#include <string>
#include<iostream>
#include<map>
#include<memory.h>
#include<vector>
#include<algorithm>
#include<queue>
#include<vector>
#include<stack>
#include<math.h>
#include<iomanip>
#include<bitset>

namespace cc
{
    using std::cout;
    using std::endl;
    using std::cin;
    using std::map;
    using std::vector;
    using std::string;
    using std::sort;
    using std::priority_queue;
    using std::greater;
    using std::vector;
    using std::swap;
    using std::stack;
    using std::bitset;


    constexpr int N = 10010;

    int a[N];
    int aa[N];

    void init(int n)
    {
        for (int i = 0;i < n;i++)
            a[i] = i;
    }
    void dfs(int s, int e)
    {
        if (s >= e - 2)
            return;
        for (int i = s;i < e;i++)
        {
            aa[i] = a[i];
        }
        int ss = s;
        for (int j = s;j < e;j += 2)

            a[ss++] = aa[j];

        int next = ss;
        for (int j = s + 1;j < e;j += 2)
            a[ss++] = aa[j];
        dfs(s, next);
        dfs(next, e);
    }
    void solve()
    {
        int n;
        while (cin >> n && n)
        {
            init(n);
            dfs(0,n);
            cout << n << ":";
            for (int i = 0;i < n;i++)
                cout << " " << a[i];
            cout << endl;
        }
    }

};


int main()
{

#ifndef ONLINE_JUDGE
    freopen("d://1.text", "r", stdin);
#endif // !ONLINE_JUDGE
    cc::solve();
    return 0;
}