View Code of Problem 57

#include<iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<string>
#include<cmath>

using namespace std;


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

	int max = 2 * n - 1;

	for (int i = 1; i <= n; i++) {

		int sum = 2 * i - 1;
		int kong = (max - sum) / 2;

		for (int j = 0; j < kong; j++)
			cout << " ";

		for (int j = 0; j <= sum / 2; j++) {

			cout << j + 1;
		}

		for (int j = sum / 2 - 1; j >= 0; j--) {

			cout << j + 1;
		}

		cout << endl;
	}

	for (int i = n - 1; i >= 1; i--) {

		int sum = 2 * i - 1;
		int kong = (max - sum) / 2;

		for (int j = 0; j < kong; j++)
			cout << " ";

		for (int j = 0; j <= sum / 2; j++) {

			cout << j + 1;
		}

		for (int j = sum / 2 - 1; j >= 0; j--) {

			cout << j + 1;
		}

		if (i != 1)
			cout << endl;
	}
}