For this Question: Given are integers a, b, c, and d. If x and y are integers and a&le;x&le;b and c&le;y&le;d hold, what is the maximum possible value of x*y?The input consists of four space-separated integers.
a b c d

<b>Constraints</b>
−10^9&le;a&le;b&le;10^9
−10^9&le;c&le;d&le;10^9
 
All values in the input are integers.Print the maximum product.<b>Sample Input 1</b> 
1 2 1 1
<b>Sample Output 1</b> 
2

<b>Sample Input 2</b> 
3 5 -4 -2
<b>Sample Output 2</b> 
-6

<b>Sample Input 3</b> 
-1000000000 0 -1000000000 0
<b>Sample Output 3</b> 
1000000000000000000, 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;
    cout<<max(max(a*c,a*d),max(b*c,b*d))<<"\n";
}
, In this Programming Language: C++, Now tell me if this Code is compilable or not?