POJ1941 The Sierpinski Fractal

Description

Consider a regular triangular area, divide it into four equal triangles of half height and remove the one in the middle. Apply the same operation recursively to each of the three remaining triangles. If we repeated this procedure infinite times, we'd obtain something with an area of zero. The fractal that evolves this way is called the Sierpinski Triangle. Although its topological dimension is 2, its Hausdorff-Besicovitch dimension is log(3)/log(2)~1.58, a fractional value (that's why it is called a fractal). By the way, the Hausdorff-Besicovitch dimension of the Norwegian coast is approximately 1.52, its topological dimension being 1.

For this problem, you are to outline the Sierpinski Triangle up to a certain recursion depth, using just ASCII characters. Since the drawing resolution is thus fixed, you'll need to grow the picture appropriately. Draw the smallest triangle (that is not divided any further) with two slashes, to backslashes and two underscores like this:

 /\

/__\

To see how to draw larger triangles, take a look at the sample output.

Input

The input contains several testcases. Each is specified by an integer n. Input is terminated by n=0. Otherwise 1<=n<=10 indicates the recursion depth.

Output

For each test case draw an outline of the Sierpinski Triangle with a side's total length of 2ⁿ characters. Align your output to the left, that is, print the bottom leftmost slash into the first column. The output must not contain any trailing blanks. Print an empty line after each test case.

Sample Input

3
2
1
0

Sample Output

       /\
      /__\
     /\  /\
    /__\/__\
   /\      /\
  /__\    /__\
 /\  /\  /\  /\
/__\/__\/__\/__\

   /\
  /__\
 /\  /\
/__\/__\

 /\
/__\

Hint

The Sierpinski-Triangle up to recursion depth 7

Source

Ulm Local 2002

 

 

 

正解：模拟

解题报告：

　　北大夏令营考过这道题，然而我没有做出来，当时真是傻了。

　　递归构造字符，注意多余的要输出空格。

　　看一下代码中的细节吧。

 

//It is made by jump~
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <ctime>
#include <vector>
#include <queue>
#include <map>
#include <set>
using namespace std;
typedef long long LL;
char ch[2048][2048];
int n;

inline int getint()
{
       int w=0,q=0; char c=getchar();
       while((c<'0' || c>'9') && c!='-') c=getchar(); if(c=='-') q=1,c=getchar(); 
       while (c>='0' && c<='9') w=w*10+c-'0', c=getchar(); return q ? -w : w;
}

inline void solve(int x,int y,int now){
    if(now==1) { 
    ch[x][y]='/'; ch[x][y+1]='_'; ch[x][y+2]='_'; ch[x][y+3]='\\';
    ch[x-1][y+1]='/'; ch[x-1][y+2]='\\';
    return ;
    }
    int du=(1<<now);//拆分成三个小三角形
    solve(x,y,now-1); solve(x,y+du,now-1); solve(x-du/2,y+du/2,now-1);
}

inline void work(){
    while(1) {
    n=getint(); if(n==0) break;
    memset(ch,0,sizeof(ch)); int mi=(1<<n);
    solve(mi,0,n); int last;//记录最后一个
    for(int i=1;i<=mi;i++) {
        for(int j=0;j<mi*2;j++) if(ch[i][j]) last=j;
        for(int j=0;j<last;j++) if(!ch[i][j]) ch[i][j]=' ';
    }
    for(int i=1;i<=mi;i++) printf("%s\n",ch[i]);
    printf("\n");
    }
}

int main()
{
  work();
  return 0;
}