Pattern

To print 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;j++){
            if(j<n-i)
                cout<<"\t";
            else 
                cout<<"\t*";
        }
        cout<<endl;
    }
    
    return 0;
}

Comments

Must Read:

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...

Knights Tour

1. You are given a number n, the size of a chess board. 2. You are given a row and a column, as a starting point for a knight piece. 3. You are required to generate the all moves of a knight starting in (row, col) such that knight visits all cells of the board exactly once. 4. Complete the body of printKnightsTour function - without changing signature - to calculate and print all configurations of the chess board representing the route of knight through the chess board. Use sample input and output to get more idea. Note -> When moving from (r, c) to the possible 8 options give first precedence to (r - 2, c + 1) and move in clockwise manner to explore other options. Input Format A number n A number row A number col Output Format All configurations of the chess board representing route of knights thro...

RDBMS Data Definition Language | Test Your Understanding 1

Refer the below schema, and modify the given query appropriately in order to create the product table. COLUMN NAME DATATYPE SIZE CONSTRAINT prod_id number 4 Primary key prod_name varchar2 25 Prod_expiry_date date Not null Evaluation Result: Result Description Summary of tests +------------------------------+ | 3 tests run / 3 test passed | +------------------------------+

Data Formats ( XML & JSON ) XML AND JSON XML AND JSON | Quiz 1

Data Formats ( XML & JSON ) XML AND JSON XML AND JSON Quiz 1

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] ...

Accenture Mock Quiz | Part 4

Question 31 Correct Marked out of 1.00 Flag question Question text What will be the output of the following Java code? class Test extends Throwable { } class Base extends Test {} public class Main { public static void main(String args[]) { try { throw new Base(); } catch(Test t) { System.out.println("Test Exception"); } finally { System.out.println("Finally block "); } } } Select one: a. Complilation error : Bass calss can't extends Test b. print-"Test Exception" c. Complilation error: Test Class cant extends Throwable d. print - "Test Exception" "Finally block " Feedback The correct answer is: print - "Test Exception" "Finally block " Question 32 Correct Marked out of 1.00 Flag question Question text Which of the following statement(s) is/are TRUE? (i) In a non-correlated(independent) subquery, the subquery is always executed only onc...

Accenture TFA Quiz | Part 1

Question 1 Correct Marked out of 1 Flag question Question text The employee table contains EmployeeNumber, EmployeeName, Salary and DeptCode Columns. Which is the CORRECT SQL query to display DeptCode and average salary of each department? Choose most appropriate option. Select one: a. SELECT DeptCode,avg(salary) FROM Employee GROUP BY DeptCode; b. SELECT DeptCode,avg(salary) FROM Employee GROUP BY EmployeeNumber; c. SELECT DeptCode,avg(salary) FROM Employee; d. SELECT DeptCode,avg(salary) FROM Employee GROUP BY Salary; Feedback The correct answer is: SELECT DeptCode,avg(salary) FROM Employee GROUP BY DeptCode; Question 2 Correct Marked out of 1 Flag question Question text Which is the CORRECT SQL Query to display names of employees which has only 3 letters that starts with 'A' and ends with 'e'? Choose most appropriate option. Select one: a. SELECT EmployeeName FROM Employee WHERE EmployeeName LIKE 'A_e'; b. SELECT Em...

Goldmine

1. You are given a number n, representing the number of rows. 2. You are given a number m, representing the number of columns. 3. You are given n*m numbers, representing elements of 2d array a, which represents a gold mine. 4. You are standing in front of left wall and are supposed to dig to the right wall. You can start from any row in the left wall. 5. You are allowed to move 1 cell right-up (d1), 1 cell right (d2) or 1 cell right-down(d3). 6. Each cell has a value that is the amount of gold available in the cell. 7. You are required to identify the maximum amount of gold that can be dug out from the mine. Input Format A number n A number m e11 e12.. e21 e22.. .. n * m number of elements Output Format An integer representing Maximum gold available. Constraints 1 <= n <= 10^2 1 <= m <= 10^2 0 <= e1, e2, .. n * m elements <= 1000 Sample Input 6 6 0 1 4 2 8 2 4 3 6 5 0 4 1 2 4 1 4 6 2 0 7 3 2 2 3 1 5 9 2 4 2 7 0 8 5 1 Sample Output 33 Solution:...

Accenture Mock Quiz | Part 3

Question 21 Correct Marked out of 1.00 Flag question Question text Identify the predicate which selects the last Employee element that is the child of the Company element? Select one: a. /Company/Employee[first()-1] b. /Company/Employee[1] c. /Company/Employee[first-1] d. /Company/Employee[last()] Feedback The correct answer is: /Company/Employee[last()] Question 22 Incorrect Marked out of 1.00 Flag question Question text Find out the well-formed xml file Select one: a. <book category="Web"> <bname>XML Tutorials</bname> <pages>100</pages> <price>$300.00</price> </book> b. <book category="Web"> <bname>XML Tutorials</BNAME> <pages>100</pages> <price>$300.00<price> <book> c. <book category="Web"> <bname>XML Tutoria...

Get's Answer

Search This Blog