Advertisement
MohamedAbdel3al

Cards for Friends

Sep 20th, 2022
921
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C++ 2.31 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2.  
  3. using namespace std;
  4.  
  5. #define cin(vec) for(auto& i : vec) cin >> i
  6. #define cin_2d(vec, n, m) for(int i = 0; i < n; i++) for(int j = 0; j < m && cin >> vec[i][j]; j++);
  7. #define cout(vec) for(auto& i : vec) cout << i << " "; cout << "\n";
  8. #define cout_2d(vec, n, m) for(int i = 0; i < n; i++, cout << "\n") for(int j = 0; j < m && cout << vec[i][j] << " "; j++);
  9. #define cout_map(mp) for(auto& [f, s] : mp) cout << f << "  " << s << "\n";
  10. #define Time cerr << "Time Taken: " << (float)clock() / CLOCKS_PER_SEC << " Secs" << "\n";
  11. #define fixed(n) fixed << setprecision(n)
  12. //#define ceil(n, m) (((n) / (m)) + ((n) % (m) ? 1 : 0))
  13. #define fill(vec, value) memset(vec, value, sizeof(vec));
  14. #define Num_of_Digits(n) ((int)log10(n)+1)
  15. #define all(vec) vec.begin(),vec.end()
  16. #define rall(vec) vec.rbegin(),vec.rend()
  17. #define sz(x) int(x.size())
  18. #define TC int t; cin >> t;   while(t--)
  19. #define fi first
  20. #define se second
  21. #define Pair pair < int, int >
  22. #define ll long long
  23. #define ull unsigned long long
  24. #define Mod  1'000'000'007
  25. #define OO 2'000'000'000
  26. #define EPS 1e-9f
  27. #define PI acos(-1)
  28. #define imin INT_MIN
  29. #define imax INT_MAX
  30. #define getline(s) getline(cin >> ws , s)
  31. #define pb(x) push_back(x)
  32. #define to_decimal(bin) stoi(bin, nullptr, 2)
  33. #define mod_combine(a, b, m) (((a % m) * (b % m)) % m)
  34. #define debug(x) cout << #x << ": " << (x) << "\n";
  35.  
  36.  
  37. void Code_Crush(){
  38.     ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
  39. #ifndef ONLINE_JUDGE
  40.     freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);  
  41. #endif
  42.     Time
  43. }
  44.  
  45. /*
  46.     Notes
  47.  
  48.     Lower bound -> smallest number greater than or (equal) tagret
  49.     Upper bound -> smallest number greater than target
  50.     n % a = (n + x * a) % a
  51. */
  52.  
  53. /*
  54.     Check Test Cases
  55. */
  56.  
  57.                                         // THINK TWICE .. CODE ONCE //
  58.  
  59.  
  60. void Solve(){
  61.     int w, h, n;
  62.     cin >> w >> h >> n;
  63.     int sheet = w * h;
  64.     if(sheet % 2 == 1 && n == 1) return void(cout << "YES" << '\n');
  65.     int cnt = 0;
  66.     while(sheet % 2 == 0){
  67.         cnt += 2, sheet /= 2;
  68.     }
  69.     cout << cnt << ' ';
  70.     cout << (cnt >= n ? "YES" : "NO") << '\n';
  71. }
  72.  
  73. int main (){
  74.     Code_Crush();
  75.     int t = 1;
  76.     cin >> t;
  77.     while(t--){
  78.         Solve();
  79.     }
  80.     return 0;
  81. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement