Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<stdio.h>
- #include<stdlib.h>
- int main()
- {
- int a=65,n,i,j,k=0,m,p;
- scanf("%d",&n);
- int ma[n][n];
- for(i=0;i<n;i++)
- for(j=0;j<n;j++)
- ma[i][j]=1;
- while(k<n)
- {
- for(i=k;i<n-k;i++)
- if(i<n-(k+1))
- if(ma[k][i]==1)
- {
- ma[k][i]=a;
- if(a!=90)
- a++;
- else
- a=65;
- }
- i=n-(k+1);
- for(j=k;j<n-k;j++)
- if(j<n-(k+1))
- if(ma[j][i]==1)
- {
- ma[j][i]=a;
- if(a!=90)
- a++;
- else
- a=65;
- }
- j=n-(k+1);
- for(;i>=k;i--)
- if(i>k)
- if(ma[j][i]==1)
- {
- ma[j][i]=a;
- if(a!=90)
- a++;
- else
- a=65;
- }
- for(;j>=k;j--)
- if(j>k)
- if(ma[j][k]==1)
- {
- ma[j][k]=a;
- if(a!=90)
- a++;
- else
- a=65;
- }
- k++;
- }
- if(ma[(n-1)/2][(n-1)/2]==1)
- ma[(n-1)/2][(n-1)/2]=a;
- for(m=0;m<n;m++)
- {
- for(p=0;p<n;p++)
- printf("%2c",ma[m][p]);
- printf("\n");
- }
- return 0;
- }
Add Comment
Please, Sign In to add comment