New: 77 pattern programs with tested code in C, C++, Java and Python Explore patterns

Square Number Triangle

Read summary with AI tools
Table of contents
  1. Output
  2. How the square number triangle works
  3. Program in C
  4. Program in C++
  5. Program in Java
  6. Program in Python
  7. Time and space complexity
  8. Related patterns

Every row lists the squares 1, 4, 9 … up to i². The logic is explained step by step, and the full program is given in C, C++, Java and Python.

This program is part of the Series Patterns collection.

Square Number Triangle output

Output (n = 5):

  1
  1  4
  1  4  9
  1  4  9 16
  1  4  9 16 25
Square Number Triangle layout diagram, row by row (n = 5)
The numbers of the square number triangle laid out row by row (n = 5).

How the square number triangle works

The inner loop prints j × j for each column.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Print i numbers (value j × j).
  3. Move to the next line.

Square Number Triangle in C

#include <stdio.h>

int main(void) {
    int n = 5;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++)
            printf("%3d", j * j);
        printf("\n");
    }
    return 0;
}

Square Number Triangle in C++

#include <iostream>
#include <iomanip>
using namespace std;

int main() {
    int n = 5;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= i; j++)
            cout << setw(3) << j * j;
        cout << endl;
    }
    return 0;
}

Square Number Triangle in Java

public class SquareNumberTriangle {
    public static void main(String[] args) {
        int n = 5;

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= i; j++)
                System.out.printf("%3d", j * j);
            System.out.println();
        }
    }
}

Square Number Triangle in Python

n = 5

for i in range(1, n + 1):
    for j in range(1, i + 1):
        print(f"{j * j:3d}", end="")
    print()

Time and space complexity

The program prints one character for each position in the pattern, so for n rows it runs in O(n²) time. It only needs a few loop variables, so the extra memory is O(1).

Authored by

Ghanendra Yadav runs Pattern Programs from Bangalore, India. The site started in 2020 to help students practise loops and logic through pattern programs in C, C++, Java and Python. Every program published here is compiled and run before it goes live, and the output shown is the real output.

Latest articles

Leave a comment

Your email address will not be published. Required fields are marked *

This site uses Akismet to reduce spam. Learn how your comment data is processed.