代码如下:
#include
using namespace std;
int main()
{
int a[10][10],count = 1;
for (int k = 0,n = 10;k < n;n--,k++)
{//first calculate the outermost number
for (int i = k;i < n;i++)
a[k][i] = count++;
for (int i = k + 1;i < n;i++)
a[i][n-1] = count++;
for(int i = n - 2;i >= k;i--)
a[n-1][i] = count++;
for(int i = n - 2;i > k;i--)
a[i][k] = count++;
}
for (int i = 0;i < 10;i++)
{
for (int j = 0;j < 10;j++)
cout << a[i][j] << "" ;
cout << endl;
}
return 0;
}
结果如下图: