Algorithm

B. Kana and Dragon Quest game
time limit per test
1 second
memory limit per test
256 megabytes
Problem link- https://codeforces.com/problemset/problem/1337/B
input
standard input
output
standard output

Kana was just an ordinary high school girl before a talent scout discovered her. Then, she became an idol. But different from the stereotype, she is also a gameholic.

One day Kana gets interested in a new adventure game called Dragon Quest. In this game, her quest is to beat a dragon.

 

The dragon has a hit point of x� initially. When its hit point goes to 00 or under 00, it will be defeated. In order to defeat the dragon, Kana can cast the two following types of spells.

  • Void Absorption

    Assume that the dragon's current hit point is hℎ, after casting this spell its hit point will become ⌊h2⌋+10⌊ℎ2⌋+10. Here ⌊h2⌋⌊ℎ2⌋ denotes hℎ divided by two, rounded down.

  • Lightning Strike

    This spell will decrease the dragon's hit point by 1010. Assume that the dragon's current hit point is hℎ, after casting this spell its hit point will be lowered to h−10ℎ−10.

Due to some reasons Kana can only cast no more than n� Void Absorptions and m� Lightning Strikes. She can cast the spells in any order and doesn't have to cast all the spells. Kana isn't good at math, so you are going to help her to find out whether it is possible to defeat the dragon.

Input

The first line contains a single integer t� (1≤t≤10001≤�≤1000)  — the number of test cases.

The next t� lines describe test cases. For each test case the only line contains three integers x�, n�, m� (1≤x≤1051≤�≤105, 0≤n,m≤300≤�,�≤30)  — the dragon's intitial hit point, the maximum number of Void Absorptions and Lightning Strikes Kana can cast respectively.

Output

If it is possible to defeat the dragon, print "YES" (without quotes). Otherwise, print "NO" (without quotes).

You can print each letter in any case (upper or lower).

Example
input
Copy
7
100 3 4
189 3 4
64 2 3
63 2 3
30 27 7
10 9 1
69117 21 2
output
Copy
YES
NO
NO
YES
YES
YES
YES
Note

One possible casting sequence of the first test case is shown below:

  • Void Absorption ⌊1002⌋+10=60⌊1002⌋+10=60.
  • Lightning Strike 60−10=5060−10=50.
  • Void Absorption ⌊502⌋+10=35⌊502⌋+10=35.
  • Void Absorption ⌊352⌋+10=27⌊352⌋+10=27.
  • Lightning Strike 27−10=1727−10=17.
  • Lightning Strike 17−10=717−10=7.
  • Lightning Strike 7−10=−37−10=−3.

 



 

Code Examples

#1 Code Example with C++ Programming

Code - C++ Programming

#include<bits/stdc++.h>
using namespace std;


#define ll long long
#define endl '\n'
#define debug(n) cout<<(n)<<endl;
const ll INF = 2e18 + 99;

int main(){
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  int t;
  cin>>t;
  int n, x, m;
  while(t--){
    cin>>n>>x>>m;
    while(n > 0 && m > 0){
      if(n > 20 && x > 0){
        n /= 2;
        n += 10;
        x--;
      }
      else{
        n -= 10;
        m--;
      }
    }
    (n <= 0) ? cout<<"YES"<<endl : cout<<"NO"<<endl;
  }

}
Copy The Code & Try With Live Editor

Input

x
–
+
cmd
7
100 3 4
189 3 4
64 2 3
63 2 3
30 27 7
10 9 1
69117 21 2

Output

x
–
+
cmd
YES
NO
NO
YES
YES
YES
YES
Advertisements

Demonstration

Codeforcess solution 1337-B, B. Kana and Dragon Quest game, ,C++, Java, Js and Python, 1337-B

Previous
Codeforces solution 1080-B-B. Margarite and the best present codeforces solution
Next
CodeChef solution DETSCORE - Determine the Score CodeChef solution C,C+