1. #include <bits/stdc++.h>
2. using namespace std;
4. typedef long long ll;
5. typedef pair<int, int> pii;
6. typedef pair<ll, ll> pll;
8. #define debug(x) cerr << #x << " = " << (x) << endl;
9. #define debug_pii(x) cerr << "(" << x.first << "," << x.second << ")";
10. #define rep(i, n) for(int i = 0;i < n;i++)
11. #define pb push_back
12. #define F first
13. #define S second
15. // template<typename _Ty1, typename _Ty2>
16. // ostream& operator<<(ostream& _os, const pair<_Ty1, _Ty2>& _p) {
17. // _os << '(' <<_p.first << ',' << _p.second << ')';
18. // return _os;
19. // }
20. //
21. // template<typename _Ty1, typename _Ty2>
22. // istream& operator>>(istream& _is, pair<_Ty1, _Ty2>& _p) {
23. // _is >> _p.first >> _p.second;
24. // return _is;
25. // }
27. string solve2(ll u, ll v) {
28. if(v < u) return "NO";
29. if(v == u) return "YES";
30. ll x = u;
31. ll diff = v-u;
32. for(int i = 0;i < 30;i++) {
33. bool z1 = x & (1LL << i);
34. bool z2 = diff & (1LL << i);
35. if(z1 == false && z2 == true) {
36. bool possible = false;
37. for(int j = i-1;j >= 0;j--) {
38. bool u1 = x & (1LL << j);
39. bool u2 = diff & (1LL << j);
40. if(u1 == true && u2 == true) {
41. possible = true;
42. break;
43. }
44. if(u1 == false && u2 == false) {
45. break;
46. }
47. }
48. if(!possible) return "NO";
49. }
50. }
51. return "YES";
52. }
54. string solve(ll u, ll v) {
55. if(v < u) return "NO";
56. ll x = 0, y = 0;
57. for(int i = 0; i < 30; i++) {
58. if (u & (1 << i)) x++;
59. if (v & (1 << i)) y++;
60. if (x < y) return "NO";
61. }
62. return "YES";
63. }
67. int main() {
68. ios_base::sync_with_stdio(false);
69. cin.tie(nullptr);
70. string s1, s2;
71. for(int ii = 1; ii < 50; ii++) {
72. for(int jj = 1; jj < 50; jj++) {
73. s1 = solve(ii,jj);
74. s2 = solve2(ii,jj);
75. if (s1 != s2) cout << "Fail: u = " << ii << ", v = " << jj << ": " << "correct answer is " << s1 << ", your answer is " << s2 << endl;
76. }
77. }
78. return 0;
79. }