25幻方

原题幻方

代码(AC)

#include<iostream>
#include<stdio.h>
#include<string.h>
using namespace std;


int main()
{
	int N;
	cin >> N;

	if (N > 0)
	{
		int num, a[40][40],remain;
		int lastR, lastC, currC, currR;
		memset(a, 0, sizeof(a));
		num = 1;
		a[0][N-1] = num;
		lastR = 0;
		lastC = N-1;
		remain = (2 * N - 1)*(2 * N - 1)-1;

		while (remain--)
		{
			num++;


				if (lastR == 0 &&lastC != 2*N-2)
				{
					currR = 2 * N-2;
					currC = lastC + 1;
				}
				else if (lastR != 0 &&lastC == 2*N-2)
				{
					currR = lastR - 1;
					currC = 0;
				}
				else if(lastR != 0 &&lastC != 2*N-2)
				{
					currR = lastR - 1;
					currC = lastC + 1;
				}

				if ((lastR == 0 &&lastC == 2*N-2)||a[currR][currC])
				{
					currR = lastR + 1;
					currC = lastC;
					a[currR][currC] = num;
				}
				else
					a[currR][currC] = num;




			lastC = currC;
			lastR = currR;
		}//end while


		for (int i = 0; i <= 2 * N-2; i++)
		{
			for (int j = 0; j <= 2 * N-2; j++)
				printf("%d ",a[i][j]);
			printf("\n");
		}

	}
}