POJ 2083 Fractal

最新推荐文章于 2022-03-09 22:17:58 发布

左阳暖

最新推荐文章于 2022-03-09 22:17:58 发布

阅读量728

点赞数

分类专栏：第三章.简单递归的编程实验

本文链接：https://blog.csdn.net/sunshumin/article/details/37818851

版权

第三章.简单递归的编程实验专栏收录该内容

4 篇文章 0 订阅

订阅专栏

C - Fractal(3.4.1)

Time Limit:1000MS Memory Limit:30000KB 64bit IO Format:%I64d & %I64u

Submit Status Practice POJ 2083

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

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>
using namespace std;
char map[1000][1000];
void print(int n,int x,int y)
{
	int m=1;
	if(n==1)
	{
		map[x][y]='X';
		return;
	}
	else if(n>1)
	{
		int i;
		for(i=0;i<n-2;i++)
			m=m*3;
		print(n-1,x, y);
		print(n-1,x, y+2*m);
		print(n-1,x+m, y+m);
		print(n-1,x+2*m, y);
		print(n-1,x+2*m, y+2*m);
	}
}

int main()
{
	int n;
	while(cin>>n&&n!=-1)
	{
		int i,j;
		int len=1;
		for(i=0;i<n-1;i++)
			len=len*3;
		for(i=0;i<len;i++)
			for(j=0;j<len;j++)
				map[i][j]=' ';
			print(n,0,0);
			for(i=0;i<len;i++)
			{
				for(j=0;j<len;j++)
					cout<<map[i][j];
				cout<<endl;
			}
			cout<<"-"<<endl;
	}
	return 0;
}