答案:<ol align="left" class="list-paddingleft-2"><li><p><span><span class="hljs-meta">#<span class="hljs-meta-keyword">include</span> <span class="hljs-meta-string"><iostream></span></span></span></p></li><li><p><span><span class="hljs-meta">#<span class="hljs-meta-keyword">include</span> <span class="hljs-meta-string"><cstring></span></span></span></p></li><li><p><span><span class="hljs-meta">#<span class="hljs-meta-keyword">include</span> <span class="hljs-meta-string"><cmath></span></span></span></p></li><li><p><span><span class="hljs-keyword">using</span> <span class="hljs-keyword">namespace</span> <span class="hljs-built_in">std</span>;</span></p></li><li><p><span><span class="hljs-keyword">const</span> <span class="hljs-keyword">int</span> maxn=<span class="hljs-number">3010</span>;</span></p></li><li><p><span><span class="hljs-keyword">int</span> n;</span></p></li><li><p><span><span class="hljs-keyword">int</span> ch[maxn][maxn];</span></p></li><li><p><span> </span></p></li><li><p><span><span class="hljs-function"><span class="hljs-keyword">void</span> <span class="hljs-title">init</span><span class="hljs-params">()</span><span class="hljs-comment">//标记所有显示符号位 </span></span></span></p></li><li><p><span></span>{</p></li><li><p><span> ch[<span class="hljs-number">1</span>][<span class="hljs-number">1</span>]=<span class="hljs-number">1</span>;</span></p></li><li><p><span> <span class="hljs-keyword">for</span>(<span class="hljs-keyword">int</span> k=<span class="hljs-number">2</span>;k<=<span class="hljs-number">8</span>;k++){<span class="hljs-comment">//维度 </span></span></p></li><li><p><span> <span class="hljs-keyword">int</span> p=<span class="hljs-built_in">pow</span>(<span class="hljs-number">3</span>,k<span class="hljs-number">-2</span>);<span class="hljs-comment">//偏移量 </span></span></p></li><li><p><span> <span class="hljs-keyword">for</span>(<span class="hljs-keyword">int</span> i=<span class="hljs-number">1</span>;i<=p;i++){<span class="hljs-comment">//行 </span></span></p></li><li><p><span> <span class="hljs-keyword">for</span>(<span class="hljs-keyword">int</span> j=<span class="hljs-number">1</span>;j<=p;j++){<span class="hljs-comment">//列 </span></span></p></li><li><p><span> ch[i+<span class="hljs-number">2</span>*p][j]=ch[i][j+<span class="hljs-number">2</span>*p]=ch[i+p][j+p]=ch[i+<span class="hljs-number">2</span>*p][j+<span class="hljs-number">2</span>*p]=ch[i][j];</span></p></li><li><p><span><span class="hljs-comment">//把n-1级图形作为n级图形的左上角,这个图形的每个坐标分别加上四个偏移量得到其余四个分量</span></span></p></li><li><p><span> }</span></p></li><li><p><span> }</span></p></li><li><p><span> }</span></p></li><li><p><span>}</span></p></li><li><p><span> </span></p></li><li><p><span><span class="hljs-function"><span class="hljs-keyword">void</span> <span class="hljs-title">output</span><span class="hljs-params">()</span></span></span></p></li><li><p><span></span>{</p></li><li><p><span> <span class="hljs-keyword">int</span> N=<span class="hljs-built_in">pow</span>(<span class="hljs-number">3</span>,n<span class="hljs-number">-1</span>);</span></p></li><li><p><span> <span class="hljs-keyword">for</span>(<span class="hljs-keyword">int</span> i=<span class="hljs-number">1</span>;i<=N;i++){</span></p></li><li><p><span> <span class="hljs-keyword">for</span>(<span class="hljs-keyword">int</span> j=<span class="hljs-number">1</span>;j<=N;j++){</span></p></li><li><p><span> <span class="hljs-keyword">if</span>(ch[i][j]) <span class="hljs-built_in">cout</span><<<span class="hljs-string">"X"</span>;</span></p></li><li><p><span> <span class="hljs-keyword">else</span> <span class="hljs-built_in">cout</span><<<span class="hljs-string">" "</span>;</span></p></li><li><p><span> }</span></p></li><li><p><span> <span class="hljs-built_in">cout</span><<<span class="hljs-built_in">endl</span>;</span></p></li><li><p><span> }</span></p></li><li><p><span> <span class="hljs-built_in">cout</span><<<span class="hljs-string">"-"</span><<<span class="hljs-built_in">endl</span>;</span></p></li><li><p><span>}</span></p></li><li><p><span> </span></p></li><li><p><span><span class="hljs-function"><span class="hljs-keyword">int</span> <span class="hljs-title">main</span><span class="hljs-params">()</span></span></span></p></li><li><p><span></span>{</p></li><li><p><span> init();</span></p></li><li><p><span> <span class="hljs-keyword">while</span>(<span class="hljs-built_in">cin</span>>>n&&n!=<span class="hljs-number">-1</span>){</span></p></li><li><p><span> output();</span></p></li><li><p><span> }</span></p></li><li><p><span> <span class="hljs-keyword">return</span> <span class="hljs-number">0</span>;</span></p></li><li><p><span>}</span></p></li></ol><pre class="brush:cpp;toolbar:false">//样例代码2 递归的应用
#include<bits/stdc++.h>
using namespace std;
char a[2200][2200];
void draw(int x, int y, int n){ //左上角为x,y,画一个层数为n的分型盒
if(n==0){
a[x][y] = 'X';
return;
}
draw(x,y,n-1); //左上
draw(x,y+2*pow(3,n-1),n-1);//右上
draw(x+2*pow(3,n-1), y, n-1); //左下
draw(x+2*pow(3,n-1), y+2*pow(3,n-1), n-1); //右下
draw(x+pow(3,n-1), y+pow(3,n-1), n-1);//中
}
int main(){
int n;
while(1){
memset(a,0,sizeof(0));
cin>>n;
if(n==-1) break;
draw(1,1,n-1);
for(int i = 1; i <= pow(3,n-1); i++){
for(int j = 1; j <= pow(3,n-1); j++){
if(a[i][j]==0) cout<<" ";
else cout<<"X";
}
cout<<endl;
}
cout<<"-"<<endl;
}
return 0;
}</pre>
这道题暂未补解析。