forked from kothariji/competitive-programming
-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy path(CODECHEF)chef_and_wars.cpp
68 lines (50 loc) · 1.37 KB
/
(CODECHEF)chef_and_wars.cpp
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
59
60
61
62
63
64
65
66
#include <bits/stdc++.h>
#include <set>
#include <cstdlib>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp>
// using namespace __gnu_pbds;
#include<algorithm>
#include <typeinfo>
// cout << typeid(mm).name() << endl;
#define ff first
#define ss second
#define int long long
#define pb push_back
#define mp make_pair
#define pii pair<int,int>
#define vi vector<int>
#define mii map<int,int>
#define pqb priority_queue<int>
#define pqs priority_queue<int,vi,greater<int> >
#define setbits(x) __builtin_popcountll(x)
#define zrobits(x) __builtin_ctzll(x)
#define mod 1000000007
#define inf 1e18
#define ps(x,y) fixed<<setprecision(y)<<x
#define mk(arr,n,type) type *arr=new type[n];
#define FIO ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define deb(x) cout<<#x<<" "<<x<<"\n";
int32_t main() {
FIO;
// #ifndef ONLINE_JUDGE
// freopen("input.txt", "r", stdin);
// freopen("output.txt", "w", stdout);
// #endif
int x; cin >> x; while (x--) {
int h, p, f = 0; cin >> h >> p;
while (true) {
h -= p;
p /= 2;
if (p == 0 || h == 0) {
if (h <= 0) {
f = 1;
break;
} else break;
}
}
if (f)cout << "1\n";
else cout << "0\n";
}
return 0;
}