For this Question: You are given two integers l and r, l &le; r. Find the largest possible value of a mod b over all pairs (a, b) of integers for which r &ge; a &ge; b &ge; l. As a reminder, a mod b is the remainder we get when dividing a by b. For example, 26 mod 8 = 2.The input consists of two space- separated integers l and r.

<b>Constraints</b>
1 &le; l &le; r &le; 10<sup>9</sup>Print the largest possible value of a mod b over all pairs (a, b) of integers for which r &ge; a &ge; b &ge; l.<b>Sample Input 1</b>
1 1
<b>Sample Output 1</b>
0

<b>Sample Input 2</b>
8 26
<b>Sample Output 2</b>
12, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define int long long
int t;
signed main(){
t=1;
  //  cin>>t;
    while(t--){
        int l,r;
        cin>>l>>r;
        cout<<r%max(r/2+1,l)<<endl;
    }
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?