poj2038Fractal盒分形深搜递归

来源：互联网发布：python文本分析和提取编辑：程序博客网时间：2024/06/05 10:10

Description

A fractal is an object or quantity that displays self-similarity, in a somewhat technical sense, on all scales. The object need not exhibit exactly the same structure at all scales, but the same "type" of structures must appear on all scales.
A box fractal is defined as below :

A box fractal of degree 1 is simply
X
A box fractal of degree 2 is
X X
X
X X
If using B(n - 1) to represent the box fractal of degree n - 1, then a box fractal of degree n is defined recursively as following
```
B(n - 1)        B(n - 1)        B(n - 1)B(n - 1)        B(n - 1)
```

Your task is to draw a box fractal of degree n.

Input

The input consists of several test cases. Each line of the input contains a positive integer n which is no greater than 7. The last line of input is a negative integer −1 indicating the end of input.

Output

For each test case, output the box fractal using the 'X' notation. Please notice that 'X' is an uppercase letter. Print a line with only a single dash after each test case.

Sample Input

1234-1

Sample Output

X-X X XX X-X X   X X X     XX X   X X   X X    X   X XX X   X X X     XX X   X X-X X   X X         X X   X X X     X           X     XX X   X X         X X   X X   X X               X X    X                 X   X X               X XX X   X X         X X   X X X     X           X     XX X   X X         X X   X X         X X   X X          X     X         X X   X X            X X             X            X X         X X   X X          X     X         X X   X XX X   X X         X X   X X X     X           X     XX X   X X         X X   X X   X X               X X    X                 X   X X               X XX X   X X         X X   X X X     X           X     XX X   X X         X X   X X#include <iostream>#include<cmath>#include<cstdio>using namespace std;char map[7000][7000];void dfs(int n,int x,int y)//深搜{    if(n==1)    {        map[x][y]='X';        return ;    }    int m=pow(3,n-2);    dfs(n-1,x,y);//x,y是平面x,y轴坐标    dfs(n-1,x+m,y+m);    dfs(n-1,x+2*m,y+2*m);    dfs(n-1,x+2*m,y);    dfs(n-1,x,y+2*m);}int main(){    int i,m,n,j;    while(cin>>n&&n>=0)    {        m=pow(3,n-1);        for(i=0; i<m; i++)        {            for(j=0; j<m; j++)                map[i][j]=' ';            map[i][m]='\0';//每行结束标志        }        dfs(n,0,0);        for(i=0; i<m; i++)            printf("%s\n",map[i]);        printf("-\n");    }    return 0;}

学习心得：利用深搜打印了如此复杂的图案，看来计算机语言有时候真的很神奇-

0 0