Basically, Floyd’s triangle is an arrangement of natural numbers from left to right in a right triangle. The first line contains a 1, the second line contains 2 and 3. The next line contains 4, 5 and 6. The numbers continue infinitely in this pattern.
#include <iostream>
using namespace std;
int main() {
int i, j, n, k = 1;
cout << "Enter number of rows of floyd`s trangle: ";
cin >> n;
for (i = 1; i <= n; i++) {
for (j = 1; j <= i; j++) {
cout << k << " ";
k++;
}
cout << endl;
}
return 0;
}
Enter number of rows of floyd`s trangle: 10
1
2 3
4 5 6
7 8 9 10
11 12 13 14 15
16 17 18 19 20 21
22 23 24 25 26 27 28
29 30 31 32 33 34 35 36
37 38 39 40 41 42 43 44 45
46 47 48 49 50 51 52 53 54 55