POJ-1941 The Sierpinski Fractal

题意：如图所示画出图形。

 

思路：递归~

题目连接：http://poj.org/problem?id=1941

 

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <string>
#include <algorithm>
#include <iostream>
using namespace std;
const int N=3000;

char map[N][N];

void dfs(int n,int x,int y){
    if(n==1){
        map[x][y]=map[x-1][y+1]='/';
        map[x][y+1]=map[x][y+2]='_';
        map[x][y+3]=map[x-1][y+2]='\\';
        return ;
    }
    int size=1<<(n-1);
    dfs(n-1,x,y);    
    dfs(n-1,x-size,y+size);
    dfs(n-1,x,y+2*size);
}

int main(){
    
//    freopen("data.in","r",stdin);
//    freopen("data.out","w",stdout);
    
    int n;
    while(scanf("%d",&n),n){
        memset(map,' ',sizeof(map));
        int size=1<<n;
        dfs(n,size,1);
        for(int i=1;i<=size;i++){
            for(int j=1;j<=size*2;j++)
                printf("%c",map[i][j]);
            puts("");
        }
        puts("");
    }
    return 0;
}