Skip to main content

Pyramid

/* 
To Print 
1   
2   2   
3   3   3   
4   4   4   4   
5   5   5   5   5   


*/


#include <iostream>
using namespace std;

int main(){
     #ifndef ONLINE_JUDGE
        freopen("../asset/input.txt","r",stdin);
        freopen("../asset/output.txt","w",stdout);
    #endif
    // Code here!!

    int ncin>>n;

    for(int i=1;i<=n;i++){
        for(int j=1;j<= i;j++){
            cout<<i<<"\t";
        }
        cout<<endl;
    }   

    return 0;
}

Comments

Must Read:

Software Engineering Concepts Configuration Management And Version Control Pre-Quiz

 Software Engineering Concepts       Configuration Management And Version Control            Pre-Quiz Software Engineering Concepts  Configuration Management And Version Control  Pre-Quiz |Software Engineering Concepts  Introduction to Agile Technologies  Introduction to Agile Technologies | Quiz 2 |Software Engineering Concepts  Introduction to Agile Technologies  Introduction to Agile Technologies | Quiz 1 | Software Engineering Concepts  Basics Of Testing  Post-Quiz | Software Engineering Concepts  Basics Of Testing  Test Your Understanding | Software Engineering Concepts  Basics Of Testing  Pre-Quiz | Software Engineering Concepts  Requirement Analysis  Post-Quiz Software Engineering Concepts  Requirement Analysis  Test Your Understanding Software Engineering Concepts  Requirement Analysis  Pre-Quiz Software Engineering Concepts  ...

Target Sum Subsets - Dp

1. You are given a number n, representing the count of elements. 2. You are given n numbers. 3. You are given a number "tar". 4. You are required to calculate and print true or false, if there is a subset the elements of which add       up to "tar" or not. Input Format A number n n1 n2 .. n number of elements A number tar Output Format true or false as required Constraints 1 <= n <= 30 0 <= n1, n2, .. n elements <= 20 0 <= tar <= 50 Sample Input 5 4 2 7 1 3 10 Sample Output true Solution: import java.io.*; import java.util.*; public class Main {     public static void main(String[] args) throws Exception {         Scanner sc = new Scanner(System.in);         int n = sc.nextInt();         int[] arr = new int[n];         for(int i=0;i<n;i++)             arr[i] = sc.nextInt();         int tar = sc.nextInt(); ...

Subscribe to Get's Answer by Email