Guest User

Untitled

a guest
Jul 16th, 2018
67
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.55 KB | None | 0 0
  1. #include<stdio.h>
  2. #include<stdlib.h>
  3. int main()
  4. {
  5. int a=65,n,i,j,k=0,m,p;
  6. scanf("%d",&n);
  7. int ma[n][n];
  8. for(i=0;i<n;i++)
  9. for(j=0;j<n;j++)
  10. ma[i][j]=1;
  11. while(k<n)
  12. {
  13. for(i=k;i<n-k;i++)
  14. if(i<n-(k+1))
  15. if(ma[k][i]==1)
  16. {
  17. ma[k][i]=a;
  18. if(a!=90)
  19. a++;
  20. else
  21. a=65;
  22. }
  23. i=n-(k+1);
  24. for(j=k;j<n-k;j++)
  25. if(j<n-(k+1))
  26. if(ma[j][i]==1)
  27. {
  28. ma[j][i]=a;
  29. if(a!=90)
  30. a++;
  31. else
  32. a=65;
  33. }
  34. j=n-(k+1);
  35. for(;i>=k;i--)
  36. if(i>k)
  37. if(ma[j][i]==1)
  38. {
  39. ma[j][i]=a;
  40. if(a!=90)
  41. a++;
  42. else
  43. a=65;
  44. }
  45. for(;j>=k;j--)
  46. if(j>k)
  47. if(ma[j][k]==1)
  48. {
  49. ma[j][k]=a;
  50. if(a!=90)
  51. a++;
  52. else
  53. a=65;
  54. }
  55. k++;
  56. }
  57. if(ma[(n-1)/2][(n-1)/2]==1)
  58. ma[(n-1)/2][(n-1)/2]=a;
  59. for(m=0;m<n;m++)
  60. {
  61. for(p=0;p<n;p++)
  62. printf("%2c",ma[m][p]);
  63. printf("\n");
  64. }
  65. return 0;
  66. }
Add Comment
Please, Sign In to add comment