#include <iostream>
#include <vector>
#include <cstdio>
#include <ctime>
#include <cstdlib>
using namespace std;
#define m 51//row
#define n 51//column
#define down 1
#define right 2
#define left 4
#define up 8
vector <int> block_row;
vector <int> block_column;
vector <int> block_direct;
typedef struct point
{
  int x;
  int y;
}Point;
Point start,end;
int x_num=1;
int y_num=1;
int a[m+2][n+2];
void init(){//將地圖全部置1=wall
  for(int i=0;i<=m+1;i++){
    for(int j=0;j<=n+1;j++){
      a[i][j]=1;//wall
    }
  }
}
void push(int x,int y,int direct){//把一組數(shù)據(jù)存放進(jìn)三個(gè)vector容器中
  block_row.push_back(x);
  block_column.push_back(y);
  block_direct.push_back(direct);
}
int count(){//計(jì)算當(dāng)前位置周圍 墻的個(gè)數(shù)
  int cnt=0;
  if(x_num+1<=m){
    push(x_num+1,y_num,down);
    cnt++;
  } //down
  if(y_num+1<=n){
    push(x_num,y_num+1,right);
    cnt++;
  } //right
  if(x_num-1>=1){
    push(x_num-1,y_num,up);
    cnt++;
  } //up
  if(y_num-1>=1){
    push(x_num,y_num-1,left);
    cnt++;
  } //left
  return cnt;
}
int main(){
  start.x=1;//定義起始點(diǎn)
  start.y=1;
  end.x=m;
  end.y=n;
  init();
  srand((unsigned)time(NULL));//隨機(jī)數(shù)種子
  count();
  a[1][1]=2;
  while(block_row.size()){//第一步壓入兩堵墻（起點(diǎn)右邊和起點(diǎn)下面）進(jìn)入循環(huán)
    int num=block_row.size();
    int randnum=rand()%num;//生成0-num-1之間的隨機(jī)數(shù)，同時(shí)也是vector里的下標(biāo)
    x_num=block_row[randnum];//下面這兩行可以不寫
    y_num=block_column[randnum];
    switch(block_direct[randnum]){//選擇一個(gè)方向進(jìn)行后續(xù)操作，起始點(diǎn) 鄰塊 目標(biāo)塊 三塊區(qū)域在同一直線上 隨后移動(dòng)到目標(biāo)塊的位置
      case down:{
        x_num=block_row[randnum]+1;
        y_num=block_column[randnum];
        break;
      }
      case right:{
        x_num=block_row[randnum];
        y_num=block_column[randnum]+1;
        break; 
      }
      case left:{
        x_num=block_row[randnum];
        y_num=block_column[randnum]-1;
        break;
      }
      case up:{
        x_num=block_row[randnum]-1;
        y_num=block_column[randnum];
        break;
      }
    }
    if(a[x_num][y_num]==1){//目標(biāo)塊如果是墻
      a[block_row[randnum]][block_column[randnum]]=2;//打通墻
      a[x_num][y_num]=2;//打通目標(biāo)塊
      count();//再次計(jì)算當(dāng)前位置周圍的鄰墻個(gè)數(shù)并保存進(jìn)vector
    }      
    block_row.erase(block_row.begin()+randnum);//刪除這堵墻(把用不了的墻刪了，對(duì)于那些已經(jīng)施工過(guò)了不必再施工了，同時(shí)也是確保我們能跳出循環(huán))
    block_column.erase(block_column.begin()+randnum);
    block_direct.erase(block_direct.begin()+randnum);
  }
  for(int i=0;i<=m+1;i++){
    for(int j=0;j<=n+1;j++){
      if(a[i][j]==2){
        printf("* ");
      }
      else{
        printf("1 ");
      }
    }
    printf("\n");
  }
  return 0;
}