For this Question: There is a container with A cyan balls. Alexa will do the following operation as many times as he likes (possibly zero times):
Add B cyan balls and C red balls into the container.
Alexa's objective is to reach a situation where the number of cyan balls in the container is at most  D times the number of red balls in it.

Determine whether the objective is achievable. If it is achievable, find the minimum number of operations needed to achieve it.The input contains 4 space-separated numbers:
A B C D

<b>Constraints</b>
1 &le; A, B, C, D &le; 10<sup>5</sup>
 
All values in the input are integers.If Alexa's objective is achievable, print the minimum number of operations needed to achieve it. Otherwise, print -1.<b>Sample Input 1</b> 
5 2 3 2
<b>Sample Output 1</b> 
2

<b>Sample Input 2</b> 
6 9 2 3
<b>Sample Output 2</b> 
-1, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
int main(){
    long long A,B,C,D; cin >> A >> B >> C >> D;
    long long blue = A, red = 0;
    for(int i = 1; i <= A; i++){
        blue += B;
        red += C;
        if(blue <= D*red){
            cout << i << endl;
            return 0;
        }
    }
    cout << -1 << endl;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?