For this Question: Your friend Bob is standing in a line of N students and he got bored, so he called you and gave you a puzzle. He told you that there are no less than x students standing in front of him and no more than y students standing behind him. He asked you to find the number of different positions he could be standing in, on the basis of this information.The first line of the input contains three integers N, x, and y.

<b>Constraints:</b>
0 <= x, y < N <= 10<sup>9</sup>Print the number of different positions Bob could be standing in.Sample Input:
3 1 1

Sample Output:
2, I have written this Solution Code: #include<bits/stdc++.h>
using namespace std;
#define int long long

signed main(){
    int n, x, y;
    cin >> n >> x >> y;
    cout << n - max(x + 1, n - y) + 1;
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?