WU-蓝桥杯历届试题-打印十字图 （C++代码）

缩减到100行以内了 网上的答案都差不多这个代码量 大家可以看看
我用的是递归的方法写的

参考代码:

#include<iostream>
using namespace std;
char a[131][131];
int x;
void f(int n)
{
    if(n==0)
    {
       for(int i=(65-(4*x+5)/2);i<=(65+(4*x+5)/2);i++)
       {
         for(int j=(65-(4*x+5)/2);j<=(65+(4*x+5)/2);j++)
         {
           cout<<a[i][j];   
        }
        cout<<endl;
       }
       return;
    }
    for(int k=1;k<=n;k++)
    {
         int len=(4*k+5)/2;
         for(int i=65-len;i<=65+len;i++)
         {
           for(int j=65-len;j<=65+len;j++) 
           {
                 if(i==(65-len)||i==(65+len))
                 {
                    if(j>=(65-len+2)&&j<=(65+len-2))
                    {
                        a[i][j]='$';
                    }
                    else
                    {   
                        if(a[i][j]!='$') 
                        a[i][j]='.';
                     } 
                 }
                else if(i==(65-len+1)||(i==(65+len-1)))
                 {
                   if(j==(65-len+2)||j==(65+len-2))
                   a[i][j]='$';
                   else
                   {
                       if(a[i][j]!='$')
                       a[i][j]='.';
                     }
                 }     
                else if(i==(65-len+2)||(i==(65+len-2)))
                 {
                   if((j>=(65-len))&&(j<=(65-len+2))||(j>=(65+len)-2)&&(j<=(65+len)))
                   {
                       a[i][j]='$';
                     }
                     else
                     {
                       if(a[i][j]!='$')
                       a[i][j]='.';
                     }
                 }
                 else 
                 {  
                    if(j==(65-len)||j==(65+len))
                    {
                   	a[i][j]='$';
                    }
                   else
                   {
                       if(a[i][j]!='$')
                       a[i][j]='.';
                   }
                 }
             }
         }
    }
    f(n-1);
}
int main()
{
    int n;
    for(int i=63;i<=67;i++)
    {
        for(int j=63;j<=67;j++)
        {
            if(i==65)
            a[i][j]='$';
            if(j==65)
            a[i][j]='$';
        } 
    }
    while(cin>>n)
    {
        x=n;
        f(n);
    }
    return 0;
}