2019-03-16 黑白棋子移动

#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 1001;
char A[maxn];
int n;
void print()
{
    for(int i=1;i<=n*2+2;i++) cout<<A[i];
    cout<<endl;
}
void move(int from,int to)
{
    char c1,c2;
    c1=A[to],c2=A[to+1];
    A[to]=A[from],A[to+1]=A[from+1];
    A[from]=c1,A[from+1]=c2;
}
void dfs(int m)
{
    if(m==4)
    {
        move(4,9); print();
        move(8,4); print();
        move(2,8); print();
        move(7,2); print();
        move(1,7); print();
    }
    else
    {
        move(m,2*m+1); print();
        move(2*m-1,m); print();
        dfs(m-1);
    }
}
int main(void)
{
    cin>>n;
    for(int i=1;i<=n;i++) A[i]='o';
    for(int i=n+1;i<=2*n;i++) A[i]='*';
    A[2*n+1]=A[2*n+2]='-';
    dfs(n); 
    return 0;
}