Kane is a Twitter employee and a fitness freak. But, it is tough to say no...

  

Transcribed Image Text:

Kane is a Twitter employee and a fitness freak. But, it is tough to say no to the culinary delights of the Twitter chefs. Twitter chefs also mention the calorie value of a meal they are going to prepare for the coming days in advance. So, Kane came up with a plan to be on fast some days and eat on the other days. When he is on fast, he consumes no calories, but on the day he eats, he consumes the amount of calories mentioned in the chart by the chef. His fitness goal is the total amount of calories intake over a certain days of time, that is , he wants to consume a total of X number of calories EXACTLY. Let's say there is an array of positive integers representing calorie counts for each day, help Kane to decide if it's possible to eat the exact number of calories according to his fitness goal Example - 1: Input calCounts : (2, 9, 5, 1, 6), requiredCals : 12 Calories Output = True Because, he can eat on days - 0,1,3 (2 + 9 +1 = 12) OR he can eat on days - 2,3,4 (5 + 1+ 6) Example - 2: Input = calCounts : {2, 3, 15, 1, 16), requiredCals : 8 Calories Output = False Because, the target of 8 cannot be met by adding any of the subset of the values. Limits : Size of the Array <= 30 0< Values in the Array <= 1000000000 O< requiredCals <= 1000000000 def isPossible(calCounts, requiredCals): if _name_ '_main__': fptr = open(os.environ['OUTPUT_PATH'], 'w') calCounts_count = int(input ().strip()) calCounts = [ for - in range (calCounts count): calCounts item = int (input ().strip()) calCounts.append (calCounts_item) | requiredcals = int(input ().strip()) result = isPossible(calCounts, requiredCals) fptr.write(str (int (result)) + 'In') fptr.close () Kane is a Twitter employee and a fitness freak. But, it is tough to say no to the culinary delights of the Twitter chefs. Twitter chefs also mention the calorie value of a meal they are going to prepare for the coming days in advance. So, Kane came up with a plan to be on fast some days and eat on the other days. When he is on fast, he consumes no calories, but on the day he eats, he consumes the amount of calories mentioned in the chart by the chef. His fitness goal is the total amount of calories intake over a certain days of time, that is , he wants to consume a total of X number of calories EXACTLY. Let's say there is an array of positive integers representing calorie counts for each day, help Kane to decide if it's possible to eat the exact number of calories according to his fitness goal Example - 1: Input calCounts : (2, 9, 5, 1, 6), requiredCals : 12 Calories Output = True Because, he can eat on days - 0,1,3 (2 + 9 +1 = 12) OR he can eat on days - 2,3,4 (5 + 1+ 6) Example - 2: Input = calCounts : {2, 3, 15, 1, 16), requiredCals : 8 Calories Output = False Because, the target of 8 cannot be met by adding any of the subset of the values. Limits : Size of the Array <= 30 0< Values in the Array <= 1000000000 O< requiredCals <= 1000000000 def isPossible(calCounts, requiredCals): if _name_ '_main__': fptr = open(os.environ['OUTPUT_PATH'], 'w') calCounts_count = int(input ().strip()) calCounts = [ for - in range (calCounts count): calCounts item = int (input ().strip()) calCounts.append (calCounts_item) | requiredcals = int(input ().strip()) result = isPossible(calCounts, requiredCals) fptr.write(str (int (result)) + 'In') fptr.close ()

Answer rating: 100% (QA)

Python program def isPossiblecalCountsrequiredCals if requiredCals 0 return True if len... View the full answer