[每日一题19/01/10]A1105 旋转矩阵（模板题）【需二刷】

好麻烦啊。。
还有像四则运算这种，都好复杂。。只能靠背了。。

 

#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>

using namespace std;

bool cmp(int a, int b) { return a > b; }
int main() {
	int N, m, n, t = 0;
	scanf_s("%d", &N);
	for (n = sqrt((double)N); n >= 1; n--) {
		if (N % n == 0) {
			m = N / n;
			break;
		}
	}
	vector<int> a(N);
	for (int i = 0; i < N; i++)
		scanf_s("%d", &a[i]);
	sort(a.begin(), a.end(), cmp);
	vector<vector<int> > b(m, vector<int>(n));
	int level = m / 2 + m % 2;
	for (int i = 0; i < level; i++) {
		for (int j = i; j <= n - 1 - i && t <= N - 1; j++)
			b[i][j] = a[t++];
		for (int j = i + 1; j <= m - 2 - i && t <= N - 1; j++)
			b[j][n - 1 - i] = a[t++];
		for (int j = n - i - 1; j >= i && t <= N - 1; j--)
			b[m - 1 - i][j] = a[t++];
		for (int j = m - 2 - i; j >= i + 1 && t <= N - 1; j--)
			b[j][i] = a[t++];
	}
	for (int i = 0; i < m; i++) {
		for (int j = 0; j < n; j++) {
			printf("%d", b[i][j]);
			if (j != n - 1) printf(" ");
		}
		printf("\n");
	}
	return 0;
}