poj 2083 分形
来源:互联网 发布:淘宝烈士墙是什么意思 编辑:程序博客网 时间:2024/05/16 13:45
Fractal
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 6514 Accepted: 3226
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 :
Your task is to draw a box fractal of degree n.
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-
Source
Shanghai 2004 Preliminary
(从discuss里copy的代码)
#include <stdio.h>#include <math.h>int main(){int n;while(scanf("%d",&n)&&n--!=-1){for(int i=0;i<pow(3.0,n);i++){for(int j=0;j<pow(3.0,n);j++){int ii=i;int jj=j;int k;for(k=0;k<n&&(ii%3+jj%3)%2==0;){ii/=3;jj/=3;k++;}printf("%c",32+56*(k==n));}printf("\n");}printf("-\n");} }
- poj 2083 分形
- POJ 2083 Fractal (分形&分治)
- POJ 2083 Fractal(分形题目)
- POJ 1941 三角形分形
- poj 2083 Fractal 分形基本方法( 总结) 递归
- 有趣的分形图形-递归和数学方法解决-POJ 2083
- POJ 3122 分饼
- POJ 2104 分桶
- 贴两个分形图片,暂时离开poj一段时间
- POJ 3768 Repeater 较复杂 分形 题目
- POJ 1364 差分约束
- poj 3122 二分 分蛋糕
- poj 1020 分蛋糕问题
- POJ 1716 差分约束
- POJ 1275 差分约束
- poj 3169 差分约束
- poj 1201 差分约束
- POJ 3169 差分约束
- ubuntu 12.04 lts 源问题
- MFC UpdateData(FALSE)和UpdateData(TRUE)的作用
- 多种方法查看Oracle SQL执行计划
- tableView中动态添加,删除行
- ZOJ 3700 Ever Dream
- poj 2083 分形
- 重学C++ 大小写转换
- 整数划分问题
- ThreadLocal
- java.lang.ClassNotFoundException: org.springframework.web.context.ContextLoaderListener
- HUD3790最短路径问题(SPFA实现)
- 通过分析SQL语句的执行计划优化SQL
- 软件自动化测试框架的发展
- Why do people use enums in C++ as constants while they can use const?