Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- /*
- ░░░░░░░█▐▓▓░████▄▄▄█▀▄▓▓▓▌█
- ░░░░░▄█▌▀▄▓▓▄▄▄▄▀▀▀▄▓▓▓▓▓▌█
- ░░░▄█▀▀▄▓█▓▓▓▓▓▓▓▓▓▓▓▓▀░▓▌█
- ░░█▀▄▓▓▓███▓▓▓███▓▓▓▄░░▄▓▐█▌
- ░█▌▓▓▓▀▀▓▓▓▓███▓▓▓▓▓▓▓▄▀▓▓▐█
- ▐█▐██▐░▄▓▓▓▓▓▀▄░▀▓▓▓▓▓▓▓▓▓▌█▌
- █▌███▓▓▓▓▓▓▓▓▐░░▄▓▓███▓▓▓▄▀▐█
- █▐█▓▀░░▀▓▓▓▓▓▓▓▓▓██████▓▓▓▓▐█
- ▌▓▄▌▀░▀░▐▀█▄▓▓██████████▓▓▓▌█▌
- ▌▓▓▓▄▄▀▀▓▓▓▀▓▓▓▓▓▓▓▓█▓█▓█▓▓▌█▌
- █▐▓▓▓▓▓▓▄▄▄▓▓▓▓▓▓█▓█▓█▓█▓▓▓▐█
- */
- #include<bits/stdc++.h>
- using namespace std;
- #ifdef pikachu
- #include "../misc/dbg.h"
- #else
- #define endl "\n"
- #define debug(...);
- #endif
- #include <ext/pb_ds/assoc_container.hpp>
- #include <ext/pb_ds/tree_policy.hpp>
- using namespace __gnu_pbds;
- template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
- template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
- #define all(v) v.begin(),v.end();
- #define int int64_t
- using ll = int64_t;
- const int MOD = 1e9 + 7, INF = 1e9;
- signed main()
- {
- ios_base::sync_with_stdio(false), cin.tie(NULL);
- int tt;
- cin >> tt;
- while(tt--)
- {
- int n, m;
- cin >> n >> m;
- //m--;
- int r = m % n;
- int q = m / n;
- if(r == 0)
- {
- r = n;
- q--;
- }
- //(r + q q)...
- int num = 0;
- int a = r + q;
- int cnt = 2;
- debug(r, q);
- while(a / cnt > 0)
- {
- num += a / cnt;
- cnt *= 2;
- }
- debug(num);
- int dem = 0;
- a = r, cnt = 2;
- while(a / cnt > 0)
- {
- dem += a / cnt;
- cnt *= 2;
- }
- a = q, cnt = 2;
- while(a / cnt > 0)
- {
- dem += a / cnt;
- cnt *= 2;
- }
- debug(dem)
- if(num > dem)
- {
- cout << 0 << endl;
- }
- else
- cout << 1 << endl;
- }
- }
Advertisement
Add Comment
Please, Sign In to add comment