Input Format

• The first line of input contains an integer T$T$, denoting the number of test cases. The description of T$T$ test cases follows.
• The first and only line of each test case contains three space-separated integers X,Y$X,Y$ and Z$Z$ — the number of stocks, the price they were bought at, and the price they can be sold at, respectively.

Output Format

For each test case print on a new line a single integer — Chef's profit after selling all the stocks he has.

Constraints

• 1≤T≤100$1\le T\le 100$
• 1≤X,Y≤104$1\le X,Y\le {10}^4$
• Y≤Z≤104$Y\le Z\le {10}^4$

Sample Input 1 

3
2 5 20
3 1 2
4 5 6

Sample Output 1 

30
3
4

Explanation

Test Case 1: Chef bought X=2$X=2$ stocks for Y=5$Y=5$ each, making the total amount spent by Chef =2⋅5=10$=2\cdot 5=10$.

Chef can sell this stock today for Z=20$Z=20$, making the total amount received by Chef =2⋅20=40$=2\cdot 20=40$.

The total profit is then the amount received minus the amount spent, which equals 40−10=30$40-10=30$.

Test Case 2: Chef bought X=3$X=3$ stocks for Y=1$Y=1$ each, making the total amount spent by Chef =3⋅1=3$=3\cdot 1=3$.

Chef can sell this stock today for Z=2$Z=2$, making the total amount received by Chef =3⋅2=6$=3\cdot 2=6$.

The total profit is then the amount received minus the amount spent, which equals 6−3=3$6-3=3$.

Test Case 3: Chef bought X=4$X=4$ stocks for Y=5$Y=5$ each, making the total amount spent by Chef =4⋅5=20$=4\cdot 5=20$.

Chef can sell this stock today for Z=6$Z=6$, making the total amount received by Chef =4⋅6=24$=4\cdot 6=24$.

The total profit is then the amount received minus the amount spent, which equals 24−20=4

Solution

#include <iostream>

using namespace std;

int main()

{

    int t;

    cin>>t;

    while(t--){

        int x,y,z;

        cin>>x>>y>>z;

        int a=x*y;

        int b=x*z;

        cout<<b-a<<endl;

    }

    return 0;

}

Solution

 

The Final Task Solution|Bi Wizard School coding Tournament Solution

Your Task:

Your task is to complete the function count_set_bits() which takes an integer array arr as the first argument and the integer n representing the size of the array as the second argument and returns an integer which represents the total count of 1's in the binary representation of each element of the array.

Solution:

int count_set_bits(int *arr, int n) {

    // Write your code here..

    long long c=0;

    for(long long i=0;i<n;i++){

        long long x=arr[i],rem=0,dec=0,j=0;

        while(x>0)

        {

            long long rem=x%2;

            dec=dec*10+rem;

            x/=2;

        }

        while(dec>0){

            long long rem=dec%10;

            if(rem==1){

                c++;

            }

            dec/=10;

        }

        

    }

    return c;

}