POJ2083 Fractal 模拟

分治法的感觉，将问题分解成相似子问题，直到问题规模够小的时候在解决。

这里只要我们仔细观察就能发现 一个规模为n的形状占据一个边长为 3^(n-1)的正方形的区域。 通过这个来控制图案的形状。

 

Fractal

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 6317		Accepted: 3141

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

1
2
3
4
-1

Sample Output

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
-
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 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
             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   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 X
-

#include<iostream>
#include<stdio.h>
#include<cstring>
#include<string>

using namespace std;

char maps[1000][1000];
int n;

void dfs(int n,int x,int y)
{
    if(n==1)
        maps[x][y]='X';
    else
    {
        if(n-1)
        {
            int size=1;
            for(int i=2;i<n;i++) size*=3;
            dfs(n-1,x,y);
            dfs(n-1,x+size*2,y);
            dfs(n-1,x,y+size*2);
            dfs(n-1,x+size,y+size);
            dfs(n-1,x+size*2,y+size*2);
        }
    }
}

int main()
{
    while(~scanf("%d",&n) && n!=-1)
    {
        int size=1;
        for(int i=1;i<n;i++) size*=3;
        for(int i=0;i<size;i++)
        {
            for(int j=0;j<size;j++)
                maps[i][j]=' ';
            maps[i][size]='\0';
        }
        dfs(n,0,0);
        for(int i=0;i<size;i++)
            printf("%s\n",maps[i]);
        printf("-\n");
    }
    return 0;
}