Floyd's Triangle

Easy Patterns

Print Floyd's triangle — consecutive numbers arranged in a right-angled triangle.

Sample input

Sample output

1 2 3 4 5 6 7 8 9 10

Solution

n = 4
num = 1
for i in range(1, n + 1):
    row = []
    for j in range(i):
        row.append(str(num))
        num += 1
    print(" ".join(row))

const n = 4;
let num = 1;
for (let i = 1; i <= n; i++) {
  const row = [];
  for (let j = 0; j < i; j++) {
    row.push(num);
    num++;
  }
  console.log(row.join(" "));
}

public class Main {
    public static void main(String[] args) {
        int n = 4, num = 1;
        for (int i = 1; i <= n; i++) {
            StringBuilder sb = new StringBuilder();
            for (int j = 0; j < i; j++) {
                sb.append(num++);
                if (j < i - 1) sb.append(" ");
            }
            System.out.println(sb.toString());
        }
    }
}

fun main() {
    val n = 4
    var num = 1
    for (i in 1..n) {
        val row = StringBuilder()
        for (j in 0 until i) {
            row.append(num++)
            if (j < i - 1) row.append(" ")
        }
        println(row.toString())
    }
}

let n = 4
var num = 1
for i in 1...n {
    var row = [String]()
    for _ in 0..<i {
        row.append(String(num))
        num += 1
    }
    print(row.joined(separator: " "))
}

void main() {
  int n = 4, num = 1;
  for (int i = 1; i <= n; i++) {
    List<int> row = [];
    for (int j = 0; j < i; j++) {
      row.add(num++);
    }
    print(row.join(' '));
  }
}

#include <iostream>
using namespace std;

int main() {
    int n = 4, num = 1;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < i; j++) {
            cout << num++;
            if (j < i - 1) cout << " ";
        }
        cout << endl;
    }
    return 0;
}

#include <stdio.h>

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