CodeChef | Practice | Bottom C++ Solution by Aryan Bhan

BOTTOM

It is known that in regular dice, the sum of opposite faces is $7$ .

A regular dice is rolled and you are given the value $X$ showing on the top face. Determine the value on the bottom face.

CODE:

#include<bits/stdc++.h>
using namespace std;
int main()
{
    ios_base::sync_with_stdio(false);
    cin.ignore(NULL);
    int t;
    cin>>t;
    while (t--)
    {
        int x;
        cin>>x;
        cout<<7-x;
        cout<<"\n";    
    }
    
    return 0;
}

Sample Input 1

Sample Output 1

4
6
1

Comments

HackerRank SQL | Revising the Select Query I | codewitharyan

Problem Statement Query all columns for all American cities in the CITY table with populations larger than 100000 . The CountryCode for America is USA . Video Solution: APPROACH 1. First select all the column 2. Then use two condition a) POPULATION > 100000 b) COUNTRYCODE="USA" MYSQL QUERY select * from city where POPULATION > 100000 and COUNTRYCODE= "USA" ; Explanation 1. select * from city : It is used to select all the column from the table city. 2. where : It is used to describe conditions Thank You For Visiting...💖💖💖

Revising the Select Query II | Hackerrank SQL Solution | MYSQL

Problem Statement Query the NAME field for all American cities in the CITY table with populations larger than 120000 . The CountryCode for America is USA . The CITY table is described as follows: . Video Solution: APPROACH 1. First select name column 2. Then use two condition a) POPULATION > 120000 b) COUNTRYCODE="USA" MYSQL QUERY select name from city where POPULATION > 120000 and COUNTRYCODE= "USA" ; Explanation 1. select name from city : It is used to select all the column from the table city. 2. where : It is used to describe conditions Thank You For Visiting...💖💖💖

Compare the Triplets | Hackerrank C++

Compare the Triplets Alice and Bob each created one problem for HackerRank. A reviewer rates the two challenges, awarding points on a scale from 1 to 100 for three categories: problem clarity , originality , and difficulty . The rating for Alice's challenge is the triplet a = (a[0], a[1], a[2]) , and the rating for Bob's challenge is the triplet b = (b[0], b[1], b[2]) . The task is to find their comparison points by comparing a[0] with b[0] , a[1] with b[1] , and a[2] with b[2] . If a[i] > b[i] , then Alice is awarded 1 point. If a[i] < b[i] , then Bob is awarded 1 point. If a[i] = b[i] , then neither person receives a point. Comparison points is the total points a person earned. Given a and b , determine their respective comparison points Sample Input: 5 6 7 3 6 10 Sample Output: 1 1 CODE: #includ...

Coder Aryan

Search This Blog