Maximum Chocolates from Jars
There is a set of N jars containing chocolates. Some of them may be empty. Determine the maximum number of chocolates Andrew can pick from the jars given that he cannot pick from jars next to each other.
Write an algorithm to find the maximum number of chocolates that can be picked from the jars in such a way that the chocolates are not picked from jars next to each other.
Input
- The first line of input consists of an integer
numJars, representing the number of jars (N). - The next line consists of N space-separated integers representing the number of chocolates in each jar.
Output
Print the maximum number of chocolates that can be picked from the jars in such a way that the chocolates are not picked from jars next to each other.
Constraints
1 < N <= 1000
Example
Input:
6
5 30 99 60 5 10
Output:
135
Count of Integers with Digit Sum Equal to Y
Given an integer X, write an algorithm to find the number of integers which are less than or equal to X and whose digits add up to Y.
Description
Input
- The first line of input consists of an integer
inputNum1, representing the given number X. - The next line consists of an integer
inputNum2, representing the given number Y.
Output
Print the count of numbers whose digits add up to Y for the given number X.
Note:
If no numbers are found whose digits add up to Y for the given number X, then print -1.
Example
Input:
20
5
Output:
2
Explanation:
X is 20 and Y is 5. There are only 2 integers ≤ 20, i.e., 5 and 14 whose digits add up to 5.
我们长期稳定承接各大科技公司如TikTok、Google、Amazon等的OA笔试代写服务，确保满分通过。如有需求，请随时联系我们。
We consistently provide professional online assessment services for major tech companies like TikTok, Google, and Amazon, guaranteeing perfect scores. Feel free to contact us if you're interested.
