Pattern

/*
To print:
                *   
            *   *   
        *   *   *   
    *   *   *   *   
*   *   *   *   *   

*/


#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 n;
    cin>>n;
    
    for(int i=1;i<=n;i++){
        for(int s=0;s<n-i;s++)
            cout<<"\t";
        for(int p =0;p<i;p++)
            cout<<"*\t";
        cout<<endl;
    }
    
    return 0;
}

Comments

Must Read:

RDBMS Data Definition Language | Create Sales_info table

Write a query to create Sales_info with constraints mentioned. Refer the below schema Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

Climb Stairs With Variable Jumps

1. You are given a number n, representing the number of stairs in a staircase. 2. You are on the 0th step and are required to climb to the top. 3. You are given n numbers, where ith element's value represents - till how far from the step you could jump to in a single move. You can of course jump fewer number of steps in the move. 4. You are required to print the number of different paths via which you can climb to the top. Input Format A number n .. n more elements Output Format A number representing the number of ways to climb the stairs from 0 to top. Constraints 0 <= n <= 20 0 <= n1, n2, .. <= 20 Sample Input 10 3 3 0 2 1 2 4 2 0 0 Sample Output 5 Solution: import java.io.*; import java.util.*; public class Main { public static void main(String[] args) throws Exception { // write your code here Scanner sc = new Scanner(System.in); ...

Count Binary Strings

1. You are given a number n. 2. You are required to print the number of binary strings of length n with no consecutive 0's. Note: In this problem, you are given a number n. All we need to print is the number of binary strings of length n with no consecutive 0's For example: Sample Input: 3 Sample Output: 5 How 5? We have a total of eight binary numbers for length 3, out of which we have 5 numbers in which there are no consecutive zeros. Input Format A number n Output Format A number representing the number of binary strings of length n with no consecutive 0's. Constraints 0 < n <= 45 Sample Input 6 Sample Output 21 Solution: import java.io.*; import java.util.*; public class Main{ public static void main(String[] args) throws Exception { // write your code here Scanner sc = new Scanner(System.in); int n = sc.nextInt(); int dp[][] = new int[n+1][2]; dp[1][0] = 1; dp[1][1] ...

RDBMS Data Definition Language | Alter - Add CHECK constraint to Mobile_Master

RDBMS Data Definition Language Alter - Add CHECK constraint to Mobile_Master Refer the following schema and add a constraint CHK_WARRANTY in Mobile_Master table to ensure that the warranty in years is greater than zero. Evaluation Result: Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

RDBMS Data Definition Language | Drop Mobile Specification table (parent)

RDBMS Data Definition Language Drop Mobile Specification table (parent) Refer the following schema and drop Mobile Specification table. (Hint: To drop parent table all associate tables need to be dropped or Use 'cascade constraints' command) Evaluation Result: Result Description Summary of tests +------------------------------+ | 1 tests run / 1 test passed | +------------------------------+

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 n ; cin >> n ; for ( int i = 1 ; i <= n ; i ++){ for ( int j = 1 ; j <= i ; j ++){ ...

RDBMS Data Definition Language | Create Distributor table

Write a query to create Distributor table with constraints mentioned. Refer the below schema Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

Zero One Knapsack | Recursion

1. You are given a number n, representing the count of items. 2. You are given n numbers, representing the values of n items. 3. You are given n numbers, representing the weights of n items. 3. You are given a number "cap", which is the capacity of a bag you've. 4. You are required to calculate and print the maximum value that can be created in the bag without overflowing it's capacity. Note: Each item can be taken 0 or 1 number of times. You are not allowed to put the same item again and again. Input Format A number n v1 v2 .. n number of elements w1 w2 .. n number of elements A number cap Output Format A number representing the maximum value that can be created in the bag without overflowing it's capacity Constraints 1 <= n <= 20 0 <= v1, v2, .. n elements <= 50 0 < w1, w2, .. n elements <= 10 0 < cap <= 10 Sample Input 5 15 14 10 45 30 2 5 1 3 4 7 Sample Output 75 Solution: import java.io.*; import java.util.*; public class Main...

Coin Change Permutations

1. You are given a number n, representing the count of coins. 2. You are given n numbers, representing the denominations of n coins. 3. You are given a number "amt". 4. You are required to calculate and print the number of permutations of the n coins using which the amount "amt" can be paid. Note 1: You have an infinite supply of each coin denomination i.e. same coin denomination can be used for many installments in payment of "amt" Note 2: You are required to find the count of permutations and not combinations i.e. 2 + 2 + 3 = 7 and 2 + 3 + 2 = 7 and 3 + 2 + 2 = 7 are different permutations of same combination. You should treat them as 3 and not 1. Input Format A number n n1 n2 .. n number of elements A number amt Output Format A number representing the cou...

Get's Answer

Search This Blog