Floyd's Triangle

Problem Statement

Input Format

An integer N representing the number of rows.

Output Format

Print Floyd's triangle numbers separated by spaces.

Constraints

1 <= N <= 15

Sample Input

3

Sample Output

1
2 3
4 5 6

Explanation

Contiguous numbers starting from 1 filled progressively row by row.

Starter Code

#include <stdio.h>

int main() {
    int n;
    if (scanf("%d", &n) == 1) {
        // Write your code here
    }
    return 0;
}

Limits

• Time Limit: 1s
• Memory Limit: 256MB