fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long int
  4. #define double long double
  5. #define print(a) for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14. int x = 1;
  15. a %= mod;
  16. while (b) {
  17. if (b & 1) x = (x * a) % mod;
  18. a = (a * a) % mod;
  19. b >>= 1;
  20. }
  21. return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> a;
  31.  
  32. int consistency(int a, int b){
  33. if(a==b) return 0;
  34.  
  35. int x = 0;
  36. while(a%2==0){
  37. a /= 2;
  38. x++;
  39. }
  40.  
  41. int y = 0;
  42. while(b%2 == 0){
  43. b /= 2;
  44. y++;
  45. }
  46.  
  47. if(a != b) return -1;
  48.  
  49. return (abs(x-y)+2)/3;
  50.  
  51. }
  52.  
  53.  
  54.  
  55.  
  56.  
  57.  
  58.  
  59.  
  60.  
  61.  
  62.  
  63.  
  64.  
  65.  
  66.  
  67. int practice(int a, int b){
  68.  
  69.  
  70. return 0;
  71. }
  72.  
  73.  
  74.  
  75.  
  76.  
  77. void solve() {
  78.  
  79. int a, b;
  80. cin >> a >> b;
  81. cout << consistency(a, b) << endl;
  82.  
  83.  
  84. }
  85.  
  86.  
  87.  
  88.  
  89.  
  90. int32_t main() {
  91. ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  92.  
  93. int t = 1;
  94. cin >> t;
  95. while (t--) {
  96. solve();
  97. }
  98.  
  99. return 0;
  100. }
Success #stdin #stdout 0.01s 5320KB
stdin
11
8863319836238788 283626234759641216
10 5
11 44
17 21
1 1
96 3
2 128
1001 1100611139403776
1000000000000000000 1000000000000000000
7 1
10 8
stdout
2
1
1
-1
0
2
2
14
0
-1
-1