Hj35 serpentine matrix

describe

The snake matrix is made up of 1 The starting natural numbers are arranged in turn into a triangle on the matrix .

for example , When the input 5 when , The triangle that should be output is ：

1 3 6 10 15

2 5 9 14

4 8 13

7 12

11

Please note that this question contains multiple sets of sample inputs .

Input description ：

Enter a positive integer N（N No more than 100）

Output description ：

Output one N Snake matrix of row .

Example 1

Input ：

4

Copy output ：

1 3 6 10
2 5 9
4 8
7

Challenge the most garbage practice in the whole network

#include<iostream>
using namespace std;
int main()
{
    int n;
    while (cin >> n)
    {
        int i = 1, j = n, shownum = 0, cnt = 0;
        bool flag = true;
        int coladdval = 0;
        for (; i <= n; i++)    //n=4 when ,  4 That's ok 
        {
            cnt = i+1;         // The first number at the beginning of each line increases gradually 

            for (; j >= 1; j--)      // Column decrement per row 
            {
                if (flag)         // The first output of each line 
                {
                    shownum = i + coladdval;
                    cout << shownum << " ";
                    flag = false;
                }
                else            // Output of other columns per row 
                {
                    shownum += cnt;
                    cout << shownum << " ";
                    cnt++;
                }
                
            }
            j = n - i;     // Control the output of each column 
            flag = true;
            coladdval += i - 1;

            cout << "\n";
        }
       // n = 0;
    }
    return 0;
}

Give me another beautiful

#include<iostream>
using namespace std;
int main()
{
    int a;
    while (cin >> a)
    {
        int m = 1;
        int n;
        for (int i = 0; i < a; i++)
        {
            m += i;
            for (int j = i; j < a; j++)
            {
                int c = 1 + j;
                if (j == i)
                {
                    n = m;
                    cout << n << " ";
                }
                else {
                    cout << (n += c) << " ";
                }
            }
            cout << endl;
        }
    }
}