beats 98% at speed, 95% at memory, just solve a System of linear equations in two variables
Intuition\n Describe your first thoughts on how to solve this problem. \n\n# Approach\n Describe your approach to solving the problem. \n\n# Complexity\n- Time 
# Intuition\n<!-- Describe your first thoughts on how to solve this problem. -->\n\n# Approach\n<!-- Describe your approach to solving the problem. -->\n\n# Complexity\n- Time complexity:\n<!-- Add your time complexity here, e.g. $$O(n)$$ -->\n\n- Space complexity:\n<!-- Add your space complexity here, e.g. $$O(n)$$ -->\n\n# Code\n```\nclass Solution:\n    def numOfBurgers(self, ts: int, cs: int) -> List[int]:\n        if ts < 2 * cs or ts > 4 * cs:\n            return []\n        if ts % 2 == 0:\n            diff = ts - 2 * cs\n            if diff % 2 == 0 and cs >= diff // 2:\n                return [diff // 2, cs - diff // 2]\n        return []\n\n```
['Python3']