For this Question: Yash has a class test. There's a question that is worth X points. Yash finds that the question has 10 test cases for it. It is given that, every test case carries the same number of points. N of the test cases are passed by Yash. Find the marks he will get.The first line will contain T, the number of test cases. Then the test cases follow. Each test case contains of a single line of input, two integers X and N, the total points for the problem, and the number of test cases which pass for Yash's solution.

<b>Constraints</b>
1 &le; T &le; 100
10 &le; X &le; 200
0 &le; N &le; 10
X is a multiple of 10.For each test case, output the points scored by Yash.Sample Input :
4
10 3
100 10
130 4
70 0

Sample Output :
3
100
52
0, I have written this Solution Code: #include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T>

using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

template <class key, class value, class cmp = std::less<key>>
using ordered_map = tree<key, value, cmp, rb_tree_tag, tree_order_statistics_node_update>;
// find_by_order(k)  returns iterator to kth element starting from 0;
// order_of_key(k) returns count of elements strictly smaller than k;

#ifdef LOCAL
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)
#else
#define debug(...) 2351
#endif

#define int long long

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

inline int64_t random_long(long long l = LLONG_MIN, long long r = LLONG_MAX) {
    uniform_int_distribution<int64_t> generator(l, r);
    return generator(rng);
}

// operator overload of << for vector
template <typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    for (const auto &x : v)
        os << x << " ";
    return os;
}

int32_t main() {
    ios_base::sync_with_stdio(true);
    cin.tie(nullptr);
    cout.tie(nullptr);
    auto start = std::chrono::high_resolution_clock::now();

    int tt;
    cin >> tt;
    while (tt--) {
        int x, n;
        cin >> x >> n;
        cout << (n * x) / 10 << "\n";
    }

    auto stop = std::chrono::high_resolution_clock::now();
    auto duration = std::chrono::duration_cast<std::chrono::nanoseconds>(stop - start);
    cerr << "Time taken : " << ((long double)duration.count()) / ((long double)1e9) << "s\n";
    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?