for i in range(int(input())):
x,v,l=map(int,input().split())
while x>20 and v>0 :
x=(x//2)+10
v-=1
x-=(l*10)
if x>0:
print("NO")
else:
print("YES")#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define pb push_back;
#define mod 1000000007
// SUBMITTED BY PARVEJ AALAM 7077
ll fact(ll n)
{
if(n==1||n==0)
return 1;
else{
return n*fact(n-1)%mod;
}
}
int main()
{
ll tc;
cin>>tc;
while(tc--)
{
ll h,m,n;
cin>>h>>n>>m;
while(h>0&&n>0&&h/2+10<h){
n--;
h=h/2+10;
}
if(h<=m*10){
cout<<"YES" <<endl;
}
else{
cout<<"NO"<<endl;
}
}
return 0;
}622. Design Circular Queue | 814. Binary Tree Pruning |
791. Custom Sort String | 787. Cheapest Flights Within K Stops |
779. K-th Symbol in Grammar | 701. Insert into a Binary Search Tree |
429. N-ary Tree Level Order Traversal | 739. Daily Temperatures |
647. Palindromic Substrings | 583. Delete Operation for Two Strings |
518. Coin Change 2 | 516. Longest Palindromic Subsequence |
468. Validate IP Address | 450. Delete Node in a BST |
445. Add Two Numbers II | 442. Find All Duplicates in an Array |
437. Path Sum III | 436. Find Right Interval |
435. Non-overlapping Intervals | 406. Queue Reconstruction by Height |
380. Insert Delete GetRandom O(1) | 332. Reconstruct Itinerary |
368. Largest Divisible Subset | 377. Combination Sum IV |
322. Coin Change | 307. Range Sum Query - Mutable |
287. Find the Duplicate Number | 279. Perfect Squares |
275. H-Index II | 274. H-Index |