https://codeforces.com/contest/1472/problem/A
Problem - A - Codeforces
codeforces.com
[난이도] Div.3
[유형] 수학
[풀이]
2^(W가 2로 나눠지는 횟수) * 2^(H가 2로 나눠지는 횟수) 가 최대 자를 수 있는 조각임을 알 수 있다.
#include <cstdio>
using ll = long long;
int tc,H,W;
ll N;
int main(){
scanf("%d",&tc);
while(tc--){
scanf("%d%d%lld",&W,&H,&N);
int wc=1,hc=1;
while(W%2==0){
wc*=2;
W/=2;
}
while(H%2==0){
hc*=2;
H/=2;
}
if(wc*hc >= N) puts("YES");
else puts("NO");
}
}
https://github.com/has2/Problem-Solving/blob/master/codeforces/Round693-Div.3/A.cpp
'Problem-Solving > Codeforces' 카테고리의 다른 글
[Codeforces][Round #693][Div.3] D : Even-Odd Game (C++) (0) | 2021.01.23 |
---|---|
[Codeforces][Round #693][Div.3] C : Long Jumps (C++) (0) | 2021.01.23 |
[Codeforces][Round #650][Div.3] D : Task On The Board (C++) (0) | 2021.01.06 |
[Codeforces][Round #650][Div.3] C : Social Distance (C++) (0) | 2021.01.06 |
[Codeforces][Round #650][Div.3] B : Even Array (C++) (0) | 2021.01.06 |