1472A - Cards for Friends - CodeForces Solution


greedy math *800

Please click on ads to support us..

Python Code:

t=int(input())
for i in range(t):
    w,h,n=map(int,input().split())
    ans=1
    while w%2==0:
        w/=2
        ans*=2
    while h%2==0:
        h/=2
        ans*=2
    if ans>=n:
        print('Yes')
    else:
        print('No')

C++ Code:

#include <iostream>

using namespace std;
void solve() {
  int w, h, n;
  cin>>w>>h>>n;
  int res = 1;
  while (w%2 == 0) {
    w /= 2;
    res *= 2;
  }
  while (h % 2 == 0) {
    h /= 2;
    res *= 2;
  }
  cout << (res >= n ? "YES\n" : "NO\n");
}
int main()
{
    int t;
    cin>>t;
    while(t--){
        solve();
    }
    return 0;
}


Comments

Submit
0 Comments
More Questions

712A - Memory and Crow
1676C - Most Similar Words
1681A - Game with Cards
151C - Win or Freeze
1585A - Life of a Flower
1662A - Organizing SWERC
466C - Number of Ways
1146A - Love "A"
1618D - Array and Operations
1255A - Changing Volume
1710C - XOR Triangle
415C - Mashmokh and Numbers
8A - Train and Peter
591A - Wizards' Duel
1703G - Good Key Bad Key
1705A - Mark the Photographer
1707A - Doremy's IQ
1706B - Making Towers
1325B - CopyCopyCopyCopyCopy
1649C - Weird Sum
1324B - Yet Another Palindrome Problem
525A - Vitaliy and Pie
879A - Borya's Diagnosis
1672B - I love AAAB
1673A - Subtle Substring Subtraction
1345A - Puzzle Pieces
711A - Bus to Udayland
779B - Weird Rounding
1703D - Double Strings
1704C - Virus