Codechef-Solutions/Coin_Flip.cpp at main · abhinav8925/Codechef-Solutions · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
/*
  ***** !!!!! JAI SHREE KRISHNA !!!!! *****

  Date - 26th January 2023
  Code by - Abhinav Anand

  Problem link -> https://www.codechef.com/problems/CONFLIP?tab=statement

*/

#include <iostream>
#include <algorithm>
#include <bits/stdc++.h>
#define ll long long int
#define endl "\n"
using namespace std;

bool isprime(int n)
{
    for(int i=2;i<=sqrt(n);i++)
    {
        if(n%i==0)
            return false;
    }
    return true;
}


void solve()
{
    ll g;
    cin>>g;
    while(g--)
    {
        ll i,n,q;
        cin>>i>>n>>q;

        if(n%2!=0 && q==i)
            cout << (n/2)  << endl;
        else if(n%2!=0 && q!=i)
            cout << (n/2)+1 << endl;
        else if(n%2==0 )
            cout << n/2 << endl;
    }

}

int main() {

	ll t;
	cin>>t;

	while(t--)
	{
	    solve();
	}
	return 0;
}