Home » Java programs » Java basic programs

Java program to print Floyd’s triangle till given N rows

In this java program, we are going to print a pattern that is known as Floyd’s triangle till N rows. Here, we are taking N from the user and printing the pattern according to it.
Submitted by IncludeHelp, on December 05, 2017

Given number of rows and we have to print Floyd’s triangle using java program.

Example:

Input 
Number of rows: 10
Output:
Floyd's Triangle:
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

Program to print Floyd’s triangle in java

import java.util.Scanner;

public class Pattern15
{
    public static void main(String args[])
    {
	
        int rows, i, j, k=1;
        Scanner scan = new Scanner(System.in);
		
        System.out.print("Enter rows u want : ");
        rows = scan.nextInt();
		
        System.out.print("Floyd's Triangle :\n");
        for(i=1; i<=rows; i++)
        {
            for(j=1; j<=i; j++, k++)
            {
                System.out.print(k + " ");
            }
            System.out.println();			
        }
    }
}

Output

Enter rows u want : 10
Floyd's Triangle :
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 






Comments and Discussions

Ad: Are you a blogger? Join our Blogging forum.





Languages: » C » C++ » C++ STL » Java » Data Structure » C#.Net » Android » Kotlin » SQL
Web Technologies: » PHP » Python » JavaScript » CSS » Ajax » Node.js » Web programming/HTML
Solved programs: » C » C++ » DS » Java » C#
Aptitude que. & ans.: » C » C++ » Java » DBMS
Interview que. & ans.: » C » Embedded C » Java » SEO » HR
CS Subjects: » CS Basics » O.S. » Networks » DBMS » Embedded Systems » Cloud Computing
» Machine learning » CS Organizations » Linux » DOS
More: » Articles » Puzzles » News/Updates


© https://www.includehelp.com some rights reserved.