Shape Rule
digit i repeats rows − i + 1 times
Row 1 prints 11111, row 2 prints 2222, and so on until the last row prints a single digit.

The shrinking repeating number pattern teaches how a changing inner-loop start value controls row width. This tutorial covers the shape rule, loop structure, a live preview, algorithm steps, worked C examples, edge cases, and complexity.
digit i repeats rows − i + 1 times
Row 1 prints 11111, row 2 prints 2222, and so on until the last row prints a single digit.
Rows
for (i = 1; i <= rows; i++) walks each line as the digit increases from 1 to rows.
Digits
for (j = i; j <= rows; j++) prints digit i exactly rows − i + 1 times on that row.
Same line / next line
Repeated digits use printf("%d", i); end each row with printf("\n").
1–20 rows
Pick a row count and draw the shrinking repeating number pattern instantly in the browser.
Complexity
Total digit prints still = n(n+1)/2; extra memory stays O(1).
A shrinking repeating number pattern repeats the row digit on each line, but the row becomes shorter as i increases. With rows = 5, the output is 11111, 2222, 333, 44, 5.
In C you solve it with two nested for loops: the outer loop picks the digit, the inner loop runs from i to rows and repeats it with printf("%d", i), then printf("\n") moves to the next line.
It is a great follow-up after growing and inverted repeating patterns. Once you see how the inner-loop start controls width, many number triangles become predictable.
On row i, print digit i exactly rows − i + 1 times.
Outer picks the digit; inner controls how many times it repeats.
printf("%d", i) in the inner loop; printf("\n") after.
Compare Program 9 (growing repeats) and Program 11 (inverted triangle).
In short: for each row i from 1 to rows, repeat printf("%d", i) for j from i to rows, then call printf("\n").
Given a positive integer rows, print a shrinking repeating number pattern: row i repeats digit i exactly rows − i + 1 times, with the outer loop counting from 1 up to rows.
// First 5 rows (conceptual shape)
// 11111
// 2222
// 333
// 44
// 5 | Item | Type | Description |
|---|---|---|
rows | int | Number of triangle lines to print (typically ≥ 1). |
| Printed output | text | Each row repeats one digit; row i has rows − i + 1 copies of i, so the first row is widest. |
for i from 1 to rows:
for j from i to rows:
print i (no newline)
print newline | Approach | Idea | Best for |
|---|---|---|
| Nested loops | Outer digit + inner repeats | Learning and interviews |
putchar('0' + i) in inner loop | Write each repeated digit without printf | Leaner C style once loops are understood |
| Goal | Pattern |
|---|---|
| Walk each row | for (i = 1; i <= rows; i++) |
Repeat digit i | for (j = i; j <= rows; j++) printf("%d", i); |
| End the row | printf("\n"); |
| One-line row shortcut | putchar('0' + i) repeated per row |
| Program 11 variant | for (j = 1; j <= i; j++) printf("%d", i) (inverted triangle) |
Same pattern — different ways to emit characters.
same linePrints a digit without moving to the next line
new lineEnds the current row after all digits are printed
one digitWrites digit i when i is 1..9 — no format string
loops firstMaster nested loops before the putchar shortcut
Reach for this pattern when teaching how inner-loop bounds control row width.
Most C pattern series start here before pyramids and diamonds.
Outer/inner bound practice with an immediate visual check.
Combine loops with scanf for a flexible row count.
Compare Program 9 (1, 22, 333, …) and Program 11 (55555, 4444, …) next.
This is a console teaching pattern — not how you build modern app screens.
Key benefit: one small program that locks in nested loops, output sequencing, and O(n²) thinking.
Choose a row count between 1 and 20 and draw the shrinking repeating number pattern in the browser.
Three complete C programs — fixed row count, scanf input, and a putchar shortcut. Click View Output to reveal sample console results.
Print five rows of the shrinking repeating number pattern with nested loops.
rows = 5Hard-coded height — outer picks digit, inner runs from i to rows.
#include <stdio.h>
int main() {
int rows = 5;
int i, j;
for (i = 1; i <= rows; ++i) {
for (j = i; j <= rows; ++j) {
printf("%d", i);
}
printf("\n");
}
return 0;
} When i = 1, the inner loop runs from 1 to 5 and prints 11111. When i = 2, it prints 2222, and so on until i = rows prints a single 5. printf("\n") after the inner loop starts the next row.
Let the user choose the height at runtime.
Read the row count with scanf("%d", &rows) (check the return value in real apps).
#include <stdio.h>
int main() {
int rows;
int i, j;
printf("Enter the number of rows: ");
scanf("%d", &rows);
for (i = 1; i <= rows; ++i) {
for (j = i; j <= rows; ++j) {
printf("%d", i);
}
printf("\n");
}
return 0;
} Same nested-loop core as Example 1; only the source of rows changes. Non-numeric input leaves rows unset if you ignore scanf’s return value — always check it in safer labs.
Same shape using putchar instead of printf for each digit.
putchar('0' + i)Repeat each digit with putchar, then end the row with putchar('\n').
#include <stdio.h>
int main() {
int rows = 5;
int i, j;
for (i = 1; i <= rows; ++i) {
for (j = i; j <= rows; ++j) {
putchar('0' + i);
}
putchar('\n');
}
return 0;
} putchar('0' + i) writes one digit when i is 1..9 without a format string. Same nested-loop structure as Example 1; a leaner alternative to printf("%d", i).
#include <stdio.h> brings in printf / scanf. Set rows (fixed or from input).
for (i = 1; i <= rows; i++) picks the digit; the inner loop prints it rows - i + 1 times.
for (j = i; j <= rows; j++) repeats digit i with printf("%d", i) as the row shrinks.
printf("\n") ends the row so the next outer iteration starts fresh.
Total digit prints: 1+2+…+n = n(n+1)/2 — O(n²) time, O(1) extra memory.
rows = 4Trace each outer-loop value of i and count how many times the inner loop prints digit i.
i | Inner j range | Repeats | Printed row |
|---|---|---|---|
1 | 1..4 | 4 | 1111 |
2 | 2..4 | 3 | 222 |
3 | 3..4 | 2 | 33 |
4 | 4..4 | 1 | 4 |
Total digit prints: 1 + 2 + 3 + 4 = 10 = 4×5/2.
Where this tiny pattern (and its loop structure) shows up beyond the homework prompt.
Clearest visual proof that outer and inner bounds interact.
Example: change j <= i and watch the shape change.
Foundation for inverted, pyramid, diamond, and hollow variants.
Example: change inner bound to j <= i for growing repeats (Program 9).
Practice printf vs row newline without complex math.
Example: put printf("\n") inside the inner loop by mistake.
Swap digits for letters, stars, or spaced output once the loop works.
Example: print i + " " for spaced repeated digits on each row.
Triangular totals make O(n²) concrete for beginners.
Example: count printed digits for n = 10 still → 55.
Pair the pattern with scanf and positive-row checks.
Example: reject rows <= 0 and re-prompt.
Pro Tip: when an interviewer asks for patterns, explain the outer/inner roles first — then write the loops. The story matters as much as the code.
Why this pattern earns a permanent spot in beginner C courses.
Wrong bounds show up immediately as a broken staircase.
Only loops and console output — no arrays or math libraries.
Invert, center, hollow, or change the fill character with small edits.
Streaming output needs no storage beyond loop counters.
Pro Tip: learn the nested-loop version first; treat putchar('0' + i) in inner loop as a polish shortcut afterward.
Small habits that keep number-pattern code clean.
Use rows (or n) and keep i/j for row/column — or rename to row/col.
scanfAvoid crashes when the user types letters instead of a number.
Only call printf("\n") after the inner loop finishes the row.
for (j = i; j <= rows; j++) with printf("%d", i) is the key to shrinking width.
Trace rows = 3 on paper before coding larger demos.
Pro Tip: if the output is a vertical list of single digits per line, you almost certainly put printf("\n") inside the inner loop.
Mistakes that commonly break shrinking repeating number patterns.
Each repeated digit lands on its own line — you get a column, not a triangle.
→ Use printf("%d", i) for repeats; printf("\n") only after the inner loop.
j <= i grows repeats; j = 1 with wrong bound prints a rectangle.
→ For this shape, keep for (j = i; j <= rows; j++).
Omitting printf("\n") glues every repeat onto one endless line.
→ Always end the row after the inner loop.
Letters or empty input throw undefined rows.
→ Prefer scanf and re-prompt on failure.
Switching to i = 0 without adjusting the inner bound prints an empty first row or wrong counts.
→ If 0-based, print i with wrong inner bound (e.g. j <= i + 1).
Check these inputs before calling the solution done.
Output is just 1 on one line.
Outer loop never runs — print nothing or show a message.
rows < 0Treat as invalid; re-prompt instead of silent empty output.
Output grows as n²/2 characters — fine for labs, noisy for huge n.
Unchecked scanf leaves rows unset — check the return value.
Use j = i so row width shrinks as i grows.
Try these variations to lock in the pattern.
j from 1 to i (see Program 9)1, 22, 333, …rows down to 1scanf until rows >= 1printf("%d ", i) between repeated digitsn(n+1)/2 — hence O(n²) time.printf stays on the line; printf("\n") advances — mix them carefully.rows > 0 for interactive programs; rows = 1 should print a single 1.Quick Takeaway: outer loop picks the digit, inner loop runs from i to rows, then break the line — that is the whole pattern.
| Program | Time | Extra space |
|---|---|---|
| Nested loops (Examples 1–2) | O(rows²) | O(1) |
putchar('0' + i) in inner loop (Example 3) | O(rows²) | O(rows) per row string (temporary) |
The shrinking repeating number pattern is a compact nested-loop exercise: digit increases each row while repeat count shrinks. Master the classic two-loop version, then optionally shorten rows with putchar('0' + i) in inner loop.
Practice the three examples above, then continue to Program 13 for the alternating zigzag number triangle.
Row i repeats digit i exactly rows - i + 1 times — keep printf("%d", i) for each copy and printf("\n") for the break.
i before codingprintf("%d", i) for repeats and printf("\n") after each rowrows ≥ 1 for interactive programsscanf return value before using rowsprintf("\n") inside the inner repeat loopj = 1 when you meant Program 9 insteadrows = 1 edge casePrint the pattern the beginner-friendly way.
Row i repeats digit i (rows-i+1) times
DefinitionPicks the digit each row
CodeRuns from i to rows
CodeEnds each row
I/OO(n²) time
AnalysisRow digit i repeats rows − i + 1 times. The outer loop counts up from 1, while the inner loop runs from i to rows, so each row shrinks — still O(n²) total prints.
Next up — alternating ascending/descending rows in Program 13.
12 people found this page helpful