Source Code
#define F first
#define S second
#define rep(i,a,b) for(int i=a;!(a==b&&i!=b)&&((i<=b&&b>=a)||(i>=b&&a>=b));i+=(a<=b?1:-1))
#define pb push_back
#define Fbitl __builtin_ffs
#define bit1 __builtin_popcount
#include <iostream>
#include <math.h>
#include <algorithm>
#include <string.h>
#include <vector>
#include <queue>
#include <map>
#include <unordered_map>

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef pair<string, string> pss;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pii> vii;
typedef vector<ll> vl;
typedef vector<vl> vvl;
bool visa[(int)1e6] ;
int main(){
   ios_base::sync_with_stdio(0);cin.tie(0);
    int t;
    cin >> t;
    while ( t-- ) {
    	int n,k;
    	cin >> n >> k;
    	if ( k == 1 ) cout << 0 << endl;
    	else if ( pow(2,int(log2(k))) == k ) cout << 1 << endl;
    	else cout << (min(n,k)) / 2 << endl ;
    }
   return 0;
}
Copy
Ramadan Candies SAAD
GNU G++17
30 ms
308 KB
Wrong Answer