A right triangle of alternating 1s and 0s. Below you will see how the pattern is built, followed by complete programs in C, C++, Java and Python.
This program is part of the Tricky Patterns collection.
0-1 Triangle output
Output (n = 5):
1 0 1 1 0 1 0 1 0 1 1 0 1 0 1

How the 0-1 triangle works
(i + j + 1) % 2 flips between 1 and 0 as j increases, and each new row starts with the opposite digit to the row above.
- Run the outer loop for
ifrom1ton, one row per pass. - Print
inumbers (value(i + j + 1) % 2). - Move to the next line.
0-1 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("%d ", (i + j + 1) % 2);
printf("\n");
}
return 0;
}0-1 Triangle in C++
#include <iostream>
using namespace std;
int main() {
int n = 5;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= i; j++)
cout << ((i + j + 1) % 2) << " ";
cout << endl;
}
return 0;
}0-1 Triangle in Java
public class ZeroOneTriangle {
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.print(((i + j + 1) % 2) + " ");
System.out.println();
}
}
}0-1 Triangle in Python
n = 5
for i in range(1, n + 1):
for j in range(1, i + 1):
print((i + j + 1) % 2, 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).





