题解 | #蛇形矩阵#

#include <iostream>
using namespace std;
#include <unordered_map>
#include <string>
#include <set>
#include <vector>
#include<algorithm>
int main() {
	int arr[100][100];
	int n;
	cin >> n;
	int num = 0;
	num = 1 * n + n * (n - 1) / 2;
	int shu = 1;
	//最外侧下标和为n-1；
	for (int time = 1; time <= n; time++) {
		for (int i = 0; i < time; i++) {
			arr[time - 1 - i][i] = shu;
			shu += 1;
		}
	}
	for (int j = 0; j < n; j++) {
		for (int i = 0; i < n - j; i++) {
			cout << arr[j][i] << ' ';
		}
		cout << endl;
	}
	return 0;

}
// 64 位输出请用 printf("%lld")