For this Question: Harry is very confused after knowing all about Sirius. To lighten Harry's mood Sirius asks a fun problem to him. Sirius puts K talking skulls equally spaced on the circumference of a circle. Now he enumerates them from 1 to K in clockwise order. Now given skull X and skull Z, he asks Harry to find number of possible Y such that angle XYZ is obtuse(more than 90 degrees).
Note:- X Y and Z must be different.The first line of the input contains single integer T, denoting number of test cases.
Each test case contains three integers K, X and Z.

Constraints
1 <= T <= 10
1 <= K <= 1000000000
1 <= X, Y <= KFor each testcase print number of possible Y in a new line.Sample Input
2
6 1 3
10 1 5

Sample Output
1
3

Explanation:
For first case, 2 is the suitable skull.
For second case, 2, 3 and 4 are the suitable skulls., I have written this Solution Code: #pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define VV vector
#define pb push_back
#define bitc  __builtin_popcountll
#define m_p make_pair
#define infi 1e18+1
#define eps 0.000000000001
#define fastio ios_base::sync_with_stdio(false);cin.tie(NULL);
string char_to_str(char c){string tem(1,c);return tem;}
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
template<class T>//usage rand<long long>()
T rand() {
    return uniform_int_distribution<T>()(rng);
}
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<class T>
using oset = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
// string to integer stoi()
// string to long long stoll()
// string.substr(position,length);
// integer to string to_string();
 
//////////////
auto clk=clock();
#define all(x) x.begin(),x.end()
#define S second
#define F first
#define sz(x) ((long long)x.size())
#define int long long  
#define f80 __float128
#define pii pair<int,int>
/////////////

signed main()
{
	fastio;
	#ifdef ANIKET_GOYAL
		freopen("inputf.in","r",stdin);
		freopen("outputf.in","w",stdout);
	#endif
	int t,k,r,s,a,b;
	cin>>t;
	while(t--)
	{
		cin>>k>>r>>s;
		b=max(r,s);
		a=min(r,s);

		if(k%2==0&&(b-a)==k/2)
		    cout<<0;
		else
		if((k%2!=0&&(b-a)<=k/2)||(k%2==0&&(b-a)<k/2))
		cout<<b-a-1;
		else if((b-a)>k/2)
		cout<<k-(b-a)-1;

		cout<<endl;
	}
	#ifdef ANIKET_GOYAL
		// cout<<endl<<endl<<endl<<endl<<"Time elapsed: "<<(double)(clock()-clk)/CLOCKS_PER_SEC<<endl;
	#endif
}, In this Programming Language: C++, Now tell me if this Code is compilable or not?