hdu 2074 叠筐

#include<bits/stdc++.h>
using namespace std;
char a[85][85];
int main()
{
int n,x,y;
char c1,c2,c;
int flag=0;
while(scanf("%d%c%c%c%c",&n,&c,&c1,&c,&c2)!=EOF)
{
if(flag)
cout<<"\n";
memset(a,' ',sizeof(a));
a[x=0][y=0]=c2;
int tot=1,f=0;
if(n==1)
{
flag=1;
cout<<c1<<"\n";
continue;
}
if((n+1)/2%2==0)
f=1;
while(tot<n*n)
{
if(f)
{
if(x%2==0)
c=c2;
else
c=c1;
}
else
{
if(x%2==0)
c=c1;
else
c=c2;
}
while(y+1<n&&a[x][y+1]==' ')
{
++tot;
a[x][++y]=c;
}
while(x+1<n&&a[x+1][y]==' ')
{
++tot;
a[++x][y]=c;
}
while(y-1>=0&&a[x][y-1]==' ')
{
++tot;
a[x][--y]=c;
}
while(x-1>=0&&a[x-1][y]==' ')
{
++tot;
a[--x][y]=c;
}
}
for(int i=0;i<n;i++)
{
for(int j=0;j<n;j++)
{
if(i==0&&j==n-1||i==0&&j==0||i==n-1&&j==0||i==n-1&&j==n-1)
cout<<" ";
else
cout<<a[i][j];
}
cout<<"\n";
}
flag=1;
}
return 0;
}