用c++做螺旋方阵

#include<iostream>
#include<iomanip>
using namespace std;
int main()
{
	int n;
	cin >> n;
	int a[9][9];
	int count = 0;
	int i, j;
	for (i = 0; i < (n + 1) / 2; i++)
	{
		for (j = i; j < n - i; j++)
			a[i][j] = ++count;
		for (j = i + 1; j < n - i; j++)
			a[j][n - i - 1] = ++count;
		for (j = n - i - 2; j > i; j--)
			a[n - i - 1][j] = ++count;
		for (j = n - i - 1; j >= i + 1; j--)
			a[j][i] = ++count;

	}
	for (i = 0; i < n; i++)
	{
		for (j = 0; j < n; j++)
			cout <<setw(3)<< a[i][j];
        cout<<endl;
	}
	return 0;
}