找规律+模拟之 codevs 1160 蛇形矩阵

最新推荐文章于 2022-09-03 09:30:23 发布

Jming_

最新推荐文章于 2022-09-03 09:30:23 发布

阅读量702

点赞数

分类专栏： CODE[VS] 文章标签： codevs

本文链接：https://blog.csdn.net/waitingandhopingv/article/details/40000433

版权

CODE[VS] 专栏收录该内容

2 篇文章 0 订阅

订阅专栏

//  [10/11/2014 Sjm]
/*
(数组下标默认从 1 开始)
经分析可知：
令 myNode = ((n + 1) >> 1)，
则： myArr[myNode][myNode] = 1^2
	 myArr[myNode + 1][myNode + 1] = (1 + 2)^2
	 myArr[myNode + 2][myNode + 2] = (3 + 2)^2
	 …………
	 据此可模拟生成过程。。。
*/

#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <functional>
#include <string>
#include <cstring>
#include <vector>
#include <stack>
#include <queue>
#include <map>
using namespace std;
#define eps 1e-8
#define MAX_LEN 102

int n;
int myArr[MAX_LEN][MAX_LEN];

void Solve() {
	int val = 1;
	int myNode = ((n + 1) >> 1);
	myArr[myNode][myNode] = val * val;
	for (int i = myNode + 1; i <= n; ++i) {
		val += 2;
		myArr[i][i] = val * val;
		int northwest = myNode - (i - myNode);
		for (int j = 1; j < val; ++j) {
			myArr[i][i - j] = myArr[i][i] - j;
		}
		for (int j = 1; j < val; ++j) {
			myArr[i - j][northwest] = myArr[i][northwest] - j;
		}
		for (int j = 1; j < val; ++j) {
			myArr[northwest][northwest + j] = myArr[northwest][northwest] - j;
		}
		for (int j = 1; j < (val - 1); ++j) {
			myArr[northwest + j][i] = myArr[northwest][i] - j;
		}
	}
	int Sum = 0;
	for (int i = 1; i <= n; ++i) {
		for (int j = 1; j <= n; ++j) {
			printf("%d", myArr[i][j]);
			if (j != n) printf(" ");
			else printf("\n");
			if ((i == j) || (i + j == n + 1)) {
				Sum += myArr[i][j];
			}
		}
	}
	printf("%d\n", Sum);
}

int main() {
	scanf("%d", &n);
	Solve();
	return 0;
}