Guest User

Untitled

a guest
Dec 24th, 2025
185
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.53 KB | None | 0 0
  1.  
  2. /*
  3. ░░░░░░░█▐▓▓░████▄▄▄█▀▄▓▓▓▌█
  4. ░░░░░▄█▌▀▄▓▓▄▄▄▄▀▀▀▄▓▓▓▓▓▌█
  5. ░░░▄█▀▀▄▓█▓▓▓▓▓▓▓▓▓▓▓▓▀░▓▌█
  6. ░░█▀▄▓▓▓███▓▓▓███▓▓▓▄░░▄▓▐█▌
  7. ░█▌▓▓▓▀▀▓▓▓▓███▓▓▓▓▓▓▓▄▀▓▓▐█
  8. ▐█▐██▐░▄▓▓▓▓▓▀▄░▀▓▓▓▓▓▓▓▓▓▌█▌
  9. █▌███▓▓▓▓▓▓▓▓▐░░▄▓▓███▓▓▓▄▀▐█
  10. █▐█▓▀░░▀▓▓▓▓▓▓▓▓▓██████▓▓▓▓▐█
  11. ▌▓▄▌▀░▀░▐▀█▄▓▓██████████▓▓▓▌█▌
  12. ▌▓▓▓▄▄▀▀▓▓▓▀▓▓▓▓▓▓▓▓█▓█▓█▓▓▌█▌
  13. █▐▓▓▓▓▓▓▄▄▄▓▓▓▓▓▓█▓█▓█▓█▓▓▓▐█
  14.  */
  15.  
  16.  
  17.  
  18.  
  19. #include<bits/stdc++.h>
  20. using namespace std;
  21.  
  22. #ifdef pikachu
  23. #include "../misc/dbg.h"
  24. #else
  25. #define endl "\n"
  26. #define debug(...);
  27. #endif
  28.  
  29. #include <ext/pb_ds/assoc_container.hpp>
  30. #include <ext/pb_ds/tree_policy.hpp>
  31. using namespace __gnu_pbds;
  32.  
  33. template<class T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
  34.  
  35.  
  36. template<class T> using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;
  37.  
  38. #define all(v) v.begin(),v.end();
  39.  
  40. #define int int64_t
  41. using ll = int64_t;
  42.  
  43. const int MOD = 1e9 + 7, INF = 1e9;
  44.  
  45. signed main()
  46. {
  47.     ios_base::sync_with_stdio(false), cin.tie(NULL);
  48.     int tt;
  49.     cin >> tt;
  50.     while(tt--)
  51.     {
  52.         int n, m;
  53.         cin >> n >> m;
  54.         //m--;
  55.         int r = m % n;
  56.         int q = m / n;
  57.         if(r == 0)
  58.         {
  59.             r = n;
  60.             q--;
  61.         }
  62.         //(r + q q)...
  63.         int num = 0;
  64.         int a = r + q;
  65.         int cnt = 2;
  66.         debug(r, q);
  67.         while(a / cnt > 0)
  68.         {
  69.             num += a / cnt;
  70.             cnt *= 2;
  71.         }
  72.         debug(num);
  73.         int dem = 0;
  74.         a = r, cnt = 2;
  75.         while(a / cnt > 0)
  76.         {
  77.             dem += a / cnt;
  78.             cnt *= 2;
  79.         }
  80.  
  81.         a = q, cnt = 2;
  82.         while(a / cnt > 0)
  83.         {
  84.             dem += a / cnt;
  85.             cnt *= 2;
  86.         }
  87.         debug(dem)
  88.  
  89.         if(num > dem)
  90.         {
  91.             cout << 0 << endl;
  92.         }
  93.         else
  94.             cout << 1 << endl;
  95.  
  96.     }
  97. }
Advertisement
Add Comment
Please, Sign In to add comment