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

Row Number-Star Square (1*1*1*1)

Read summary with AI tools

Every row repeats its row number, joined with stars. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.

Quick answer: Loop over n rows and 2 × n − 1 positions per row. Print the row number i at odd positions and * at even positions. Every row has n copies of its row number joined by stars: 1*1*1*1, 2*2*2*2 and so on.

This program is part of the Number-Star Patterns collection.

Table of contents8 sections
  1. Row Number-Star Square output
  2. How the row number-star square works
  3. Row Number-Star Square in C
  4. Row Number-Star Square in C++
  5. Row Number-Star Square in Java
  6. Row Number-Star Square in Python
  7. Time and space complexity
  8. Frequently asked questions

Row Number-Star Square output

Output (n = 4):

1*1*1*1
2*2*2*2
3*3*3*3
4*4*4*4
Row Number-Star Square layout diagram, row by row (n = 4)
How each row of the row number-star square is built (n = 4). Blue cells are printed characters; grey dots are spaces.

How the row number-star square works

Odd positions print the row number i and even positions print a star.

  1. Run the outer loop for i from 1 to n, one row per pass.
  2. Go through 2 × n − 1 positions in the row. Print numbers (value i) where j % 2 = 1; print stars everywhere else.
  3. Move to the next line.

Key takeaways

  • The value depends only on i, so each row repeats one number.
  • j % 2 == 1 decides between number and star.
  • Every row is 2 × n − 1 characters long while n is 9 or less.
  • Print (i − 1) × n + (j + 1) / 2 instead to count from 1 to n² (number-star square).

Row Number-Star Square in C

#include <stdio.h>

int main(void) {
    int n = 4;

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

Row Number-Star Square in C++

#include <iostream>
using namespace std;

int main() {
    int n = 4;

    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= 2 * n - 1; j++) {
            if (j % 2 == 1)
                cout << i;
            else
                cout << "*";
        }
        cout << endl;
    }
    return 0;
}

Row Number-Star Square in Java

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

        for (int i = 1; i <= n; i++) {
            for (int j = 1; j <= 2 * n - 1; j++) {
                if (j % 2 == 1)
                    System.out.print(i);
                else
                    System.out.print("*");
            }
            System.out.println();
        }
    }
}

Row Number-Star Square in Python

n = 4

for i in range(1, n + 1):
    for j in range(1, 2 * n):
        if j % 2 == 1:
            print(i, end="")
        else:
            print("*", 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).

Frequently asked questions

What does j % 2 == 1 do?

It is true for positions 1, 3, 5…, so numbers go in the odd positions and stars in the even ones. Swap the two branches and the rows start with a star instead.

How do I make it a triangle?

Give row i 2 × i − 1 positions instead of 2 × n − 1; that gives the number-star triangle.

Does it work for n above 9?

The values are right, but two-digit numbers make the rows wider than the stars suggest. Keep n at 9 or below for a neat square.

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.