Answered step by step
Verified Expert Solution
Question
1 Approved Answer
2. You have N magical bags of candies in front of you. The th bag has A candies in it. It takes you one minute
2. You have N magical bags of candies in front of you. The th bag has A candies in it. It takes you one minute to finish a bag of candies, no matter how many candies are in it. Every time you finish a bag with X candiek in it, the bag is magically replenished with (rounded down to the nearest integer) more candies. Write a program that determines the maximum number of candies you can eat in K minutes. X The input is a sequence of integers. The first integer N is the number of bags. Then next integer K is the number of minutes you have. The next N integers are the number of candies in the bags. The output of your program is a single integer which represents the maximum number of candies you can eat. Sample Input 5 3 2 1 7 42 Sample Output 14
Step by Step Solution
There are 3 Steps involved in it
Step: 1
Get Instant Access to Expert-Tailored Solutions
See step-by-step solutions with expert insights and AI powered tools for academic success
Step: 2
Step: 3
Ace Your Homework with AI
Get the answers you need in no time with our AI-driven, step-by-step assistance
Get Started