diff --git "a/2224020152/\347\254\254\345\205\255\345\215\225\345\205\203/\346\261\2025*5\351\230\266\347\232\204\350\236\272\346\227\213\346\226\271\351\230\265.cpp" "b/2224020152/\347\254\254\345\205\255\345\215\225\345\205\203/\346\261\2025*5\351\230\266\347\232\204\350\236\272\346\227\213\346\226\271\351\230\265.cpp"
new file mode 100644
index 0000000000000000000000000000000000000000..72977fa30057356f5da94cbd99be5387dc45b3e1
--- /dev/null
+++ "b/2224020152/\347\254\254\345\205\255\345\215\225\345\205\203/\346\261\2025*5\351\230\266\347\232\204\350\236\272\346\227\213\346\226\271\351\230\265.cpp"
@@ -0,0 +1,98 @@
+# include<stdio.h>
+
+# define MaxLen 10
+
+void fun(int a[MaxLen][MaxLen],int n)
+
+{
+
+       int i,j,k=0,m;
+
+       if( n % 2==0)          
+
+              m=n/2;
+
+       else
+
+              m=n/2+1;
+
+       for(i=0;i<m;i++)
+
+       {
+
+              for(j=i;j<n-i;j++)       
+              {
+
+                     k++;
+
+                     a[i][j]=k;
+
+              }
+
+              for(j=i+1;j<n-i;j++)        
+
+              {
+
+                     k++;
+
+                     a[j][n-i-1]=k;
+
+              }
+
+              for(j=n-i-2;j>=i;j--)      
+
+              {
+
+                     k++;
+
+                     a[n-i-1][j]=k;
+
+              }
+
+              for(j=n-i-2;j>=i+1;j--)     
+
+              {
+
+                     k++;
+
+                     a[j][i]=k;
+
+              }
+
+       }
+
+}
+
+void main()
+
+{
+
+       int n,i,j;
+
+       int a[MaxLen][MaxLen];
+
+       printf("\n");
+
+       printf("输入n(n<10):");
+
+       scanf("%d",&n);
+
+       fun(a,n);
+
+       printf("%d阶数字方阵如下:\n",n);
+
+       for(i=0;i<n;i++)
+
+       {
+
+              for(j=0;j<n;j++)
+
+                     printf("%4d",a[i][j]);
+
+              printf("\n");
+
+       }
+
+       printf("\n");
+
+}
\ No newline at end of file