Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 8060 | Accepted: 3862 |
Description
B(n - 1) B(n - 1) B(n - 1) B(n - 1) B(n - 1)
Input
Output
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 -
Source
#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);//左上方n-1度 dfs(n-1,x+size*2,y);//右上方n-1度 dfs(n-1,x,y+size*2);//中间n-1度 dfs(n-1,x+size,y+size);//左下方n-1度 dfs(n-1,x+size*2,y+size*2);//右下方n-1度 } } } int main() { while(~scanf("%d",&n) && n!=-1) { int size=1,i,j; for(i=1; i<n; i++) size*=3; for(i=0; i<size; i++) { for(j=0; j<size; j++) maps[i][j]=' '; maps[i][size]='\0'; } dfs(n,0,0); for(i=0; i<size; i++) printf("%s\n",maps[i]); printf("-\n"); } return 0; }