CRED Coins codechef solution in cpp

 

CRED Coins Problem Code: CREDCOINSSubmit (Practice)

For each bill you pay using CRED, you earn X$X$ CRED coins.
At CodeChef store, each bag is worth 100$100$ CRED coins.

Chef pays Y$Y$ number of bills using CRED. Find the maximum number of bags he can get from the CodeChef store.

Input Format

• First line will contain T$T$, number of test cases. Then the test cases follow.
• Each test case contains of a single line of input, two integers X$X$ and Y$Y$.

Output Format

For each test case, output in a single line - the maximum number of bags Chef can get from the CodeChef store.

Constraints

• 1≤T≤100$1\le T\le 100$
• 1≤X,Y≤1000$1\le X,Y\le 1000$

Subtasks

• Subtask 1 (100 points): Original constraints.

Sample Input 1 

3
10 10
20 4
70 7

Sample Output 1 

1
0
4

Explanation

Test Case 1$1$: For each bill payment, one receives 10$10$ CRED coins. Chef pays 10$10$ bills using CRED. Thus, he receives 100$100$ CRED coins. Chef can get 1$1$ bag from the CodeChef store using these coins.

Test Case 2$2$: For each bill payment, one receives 20$20$ CRED coins. Chef pays 4$4$ bills using CRED. Thus, he receives 80$80$ CRED coins. Chef cannot get any bag from the CodeChef store using these coins.

Test Case 3$3$: For each bill payment, one receives 70$70$ CRED coins. Chef pays 7$7$ bills using CRED. Thus, he receives 490$490$ CRED coins. Chef can get at most 4$4$ bags from the CodeChef store using these coins.

solution

#include<iostream>
#include<vector>
#include<algorithm>
#include<climits>
#include<string>
using namespace std;

class solution
{
public:
	void solve()
	{
		int x, y, sum;
		cin >> x >> y;
		sum = x * y;
		cout << sum / 100 << "\n";
	}
};
int main()
{
	solution ss;

	int t;
	cin >> t;
	while (t--)
    {
		ss.solve();
	}

	return 0;
}