For this Question: You have r red and b blue beans. You'd like to distribute them among several (maybe, one) packets in such a way that each packet:
1. Has at least one red bean (or the number of red beans r<sub>i</sub> &le; 1);
2. Has at least one blue bean (or the number of blue beans b<sub>i</sub> &le; 1);
3. The number of red and blue beans should differ in no more than d (or |r<sub>i</sub>−b<sub>i</sub>| &le; d)
Can you distribute all beans?The input consists of three space- separated integers r, b, and d — the number of red and blue beans and the maximum absolute difference in each packet.

<b>Constraints</b>
1 &le; r, b &le;10<sup>9</sup>
0 &le; d &le;10<sup>9</sup>If you can distribute all beans, print Yes. Otherwise, print No.<b>Sample Input 1</b>
1 1 0
<b>Sample Output 1</b>
Yes

<b>Sample Input 2</b>
6 1 4
<b>Sample Output 2</b>
No, I have written this Solution Code: #include <bits/stdc++.h>
using namespace std;

int main()
{
    int t;
    t = 1;
    while (t--)
    {
        long long r, b, d;
        cin >> r >> b >> d;

        long long k, m;
        if (r > b)
        {
            k = b;
            m = r;
        }
        else
        {
            k = r;
            m = b;
        }

        if (((1 + d) * k) >= m)
        {
            cout << "Yes" << endl;
        }
        else
        {
            cout << "No" << endl;
        }
    }

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