Star Pattern

/* @ToDo

   Star Pattern 
                *   
            *   *   *   
        *   *   *   *   *   
    *   *   *   *   *   *   *   
*   *   *   *   *   *   *   *   *   
*   *   *   *   *   *   *   *   *   
    *   *   *   *   *   *   *   
        *   *   *   *   *   
            *   *   *   
                *   

   
   
*/


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

    return 0;
}

Comments

Must Read:

RDBMS Data Definition Language | Alter - Add a column age

Write a query to add a new column named Age of type number(10) to Customer_Info table.

RDBMS Data Definition Language | Alter -Modify the field type

Write a query to change the field type weight varchar(20) in Mobile_specification table to number(10). Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

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 | Create Buses table

efer the below schema and create the buses table. Column Name Datatype Size Constraint Constraint name Bus_no Number 11 Primary key PK_BUSES Bus_name Varchar2 20 Type Varchar2 20 Total_seats Number 11 Avail_seats Number 11 Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

0-1 Pattern

/* @ToDo 0-1 Pattern 1 0 1 0 1 0 1 0 1 0 1 0 1 0 1 */ #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 ; int sign = 1 ; for ( int i = 1 ; i <= n ; i ++){ ...

RDBMS Data Definition Language | Alter - removing a column in Mobile Specification

RDBMS Data Definition Language Alter - removing a column in Mobile Specification Write a query to remove the column weight from the mobile specification table. Evaluation Result: Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

Logic Development Logic Development Test Your Understanding

Logic Development | Object Oriented Programming Post Quiz

Logic Development | Object-Oriented Programming | Post Quiz

Cars and Bikes Problem Code: TYRES | CodeChef

Problem: Chef opened a company which manufactures cars and bikes. Each car requires 4 4 tyres while each bike requires 2 2 tyres. Chef has a total of N N tyres ( N N is even). He wants to manufacture maximum number of cars from these tyres and then manufacture bikes from the remaining tyres. Chef's friend went to Chef to purchase a bike. If Chef's company has manufactured even a single bike then Chef's friend will be able to purchase it. Determine whether he will be able to purchase the bike or not. Input Format The first line contains an integer T T denoting the number of test cases. The T T test cases then follow. The first line of each test case contains an integer N N denoting the number of tyres. Output Format For each test case, output YES or NO depending on whether Chef's friend will be able to purchase the bike or not. Output is case insensitive. Constraints 1 ≤ T ≤ 100 1 ≤ T ≤...

Get's Answer

Search This Blog