Codeforces 1337B Kaya and Dragon Quest Problem | Competitive Programming скачать в хорошем качестве

Codeforces 1337B Kaya and Dragon Quest Problem | Competitive Programming

#Codeforces1337B #CompetitiveProgramming #AlgorithmSolutions #CoinFairnessProblem #GreedyAlgorithm #CodingContest #ProblemSolving #Codeforces #AlgorithmExplained #programmingtips 🚀 Welcome to my channel! In this video, I'll be tackling an exciting problem from Codeforces - the 1337B Kaya And Dragon Quest Problem. 🔗 GitHub Repository: Curious to explore our code and implementation details? You can find the complete source code and documentation in our GitHub repository linked below. 📎 GitHub Repository: https://github.com/PrachetShah/Codefo... 🎯Problem Description: The dragon has a hit point of x initially. When its hit point goes to 0 or under 0, 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. Here ⌊h2⌋ denotes h divided by two, rounded down. Lightning Strike This spell will decrease the dragon's hit point by 10 . Assume that the dragon's current hit point is h, after casting this spell its hit point will be lowered to h−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≤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≤105, 0≤n,m≤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). [Disclaimer: Codeforces is a registered trademark of Codeforces.com. This video is not officially affiliated with or endorsed by Codeforces.]