For this Question: Alice is driving from her home to her office which is A kilometers away and will take her X hours to reach. Bob is driving from his home to his office which is B kilometers away and will take him Y hours to reach. Determine who is driving faster, else, if they are both driving at the same speed print EQUAL.The first line will contain T, the number of test cases. Then the test cases follow. Each test case consists of a single line of input, containing four integers A, X, B, and Y, the distances and and the times taken by Alice and Bob respectively.

<b>Constraints</b>
1 &le; T &le; 1000
1 &le; A, X, B, Y &le; 1000For each test case, if Alice is faster, print ALICE. Else if Bob is faster, print BOB. If both are equal, print EQUAL.Sample Input :
3
20 6 20 5
10 3 20 6
9 1 1 1
Sample Output :
Bob
Equal
Alice
Explanation :
<ul><li>Since Bob travels the distance between his office and house in 5 hours, whereas Alice travels the same distance of 20 kms in 6 hours, BOB is faster. </li><li>Since Alice travels the distance of 10 km between her office and house in 3 hours and Bob travels a distance of 20 km in 6 hours, they have equal speeds. </li><li> Since Alice travels the distance of 9 km between her office and house in 1 hour and Bob travels only a distance of 1 km in the same time, ALICE is faster. </li></ul>, 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);
}

vector<int> solve(int n) {
    vector<int> sol;
    for (int i = 1; i <= n; i++) {
        sol.push_back(i);
    }
    // debug(sol);
    return sol;
}

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

    int tt = 1;
    cin >> tt;
    while (tt--) {
        float A, X, B, Y;
        cin >> A >> X >> B >> Y;
        float v1 = A / X;
        float v2 = B / Y;
        if (v1 > v2) {
            cout << "ALICE\n";
        } else if (v1 < v2) {
            cout << "BOB\n";
        } else {
            cout << "EQUAL\n";
        }
    }

   

    return 0;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?