fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define ll long long
  5. #define nl "\n"
  6. #define vi vector<int>
  7. #define all(v) v.begin(), v.end()
  8. #define SORT(v) sort(all(v))
  9. #define SORTX(v) sort(v.begin(), v.end(), greater<int>())
  10. #define read(a) for (auto &i : a) cin >> i
  11. #define Printv(a) for (auto &i : a) cout << i << " "
  12. #define pii pair<int, int>
  13. #define M_ShahaT ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
  14.  
  15.  
  16. void FIO(){
  17. #ifndef ONLINE_JUDGE
  18.     freopen("Input.txt","r",stdin);
  19.     freopen("Output.txt","w",stdout);
  20. #endif
  21. }
  22. int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
  23. int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};
  24. char di[] = {'D', 'L', 'U', 'R'};
  25. double const PI=acos(-1);
  26. const ll INF = 1e18;
  27. const ll mod=1e9+7;
  28. const int N = 1e6 + 5;
  29. int f_1_to_n(int n){
  30.     return n*(n+1)/2;
  31. }
  32. bool valid(int x,int y,int row ,int col){
  33.     return x<row&&x>=0&&y<col&&y>=0;
  34. }
  35.  
  36.  
  37. void solve_case() {
  38.  ll n,l;cin>>n>>l;
  39.  ll temp=l;
  40.  int bits=0;
  41.  
  42.  while(l){
  43.      bits++;
  44.      l>>=1;
  45.  }
  46.  
  47. ll tempbit=bits;
  48.  
  49.  ll mx=1;
  50. while(bits){
  51.    mx=mx<<1;
  52.      bits--;
  53.  }
  54. mx--;//all bits 1 1  1 1  1 1
  55. if(tempbit&1){ // find max alternating
  56.  
  57.     for(int i=1;i<tempbit;i+=2){
  58.  
  59.             mx=mx^(1<<i);
  60.  
  61.     }
  62.  
  63.  
  64. }else{
  65.  
  66.     for(int i=0;i<tempbit;i+=2){
  67.  
  68.         mx=mx^(1<<i);
  69.     }
  70.  
  71. }
  72. ll ans=0;
  73.  
  74. if(mx<=temp){
  75.     ans=tempbit-1;
  76. }else {
  77.    ans=tempbit-2;
  78. }
  79. cout<<(n<=ans?"YES\n":"NO\n");
  80. }
  81.  
  82.  
  83.  
  84.  
  85. int main(){
  86.     M_ShahaT
  87.     FIO();
  88.  
  89.     int t=1;
  90.  
  91.                                            cin >> t;
  92.     for(int i=1;i<=t;i++){
  93.  
  94.         solve_case();
  95.  
  96.     }
  97.     return 0;
  98. }
Success #stdin #stdout 0.01s 5288KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
YES
https://ideone.com/ksNwdZ
language:
C++ (gcc 8.3)
created:
9 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!