You may be curious why we, the government, has kidnapped you and has been keeping you locked up in here. We've been watching you and we know what you're capable of. We uncovered a mysterious box...

anyone can help?

Extracted text: You may be curious why we, the government, has kidnapped you and has been keeping you locked up in here. We've been watching you and we know what you're capable of. We uncovered a mysterious box thingy from an extraterrestrial U.F.O. last week and it has a strange pattern. The President thinks that uncovering the contents of this box could open up trade relations with the aliens so you MUST help us. It seems like that for whatever number you input, the box changes its pattern and we definitely see something strange going on at the end of the row but thats all we have been able to observe. You have no choice but to help us because the fate of the country's trade relations depend on you. Input 1. The number you inputted Constraints The value is guaranteed to be greater than or equal to 2. Output The first line will contain a message prompt to input your number. The succeeding lines will contain the pattern of the box. Enter your number: 4 1.112 2.2 2 3 3 3 3 4 4.4 4 5


Extracted text: Hey I've got this cool idea for an app! It's kind of simple but just hear me out. All the user has to do is enter a bunch of integers. Then the application prints the largest sum of a strictly ascending sequence of the array. A strictly ascending sequence is a sequence where the current number is always lesser than the next number. For example, the user enters 2 4 517 3, the output should be 11 (2 + 4 + 5). Then that's it! I think this is going to be a hit! Don't you think? Well I do. If you help me then we're going to be rich! Note: For this problem, a sequence must contain at least 2 numbers. If there is no sequence found, then the largest sum is 0. Input 1. The size of the array Constraints The value is within the range: 0 <= size=""><= 2147483647="" 2.="" elements="" of="" the="" array="" constraints="" each="" element=""><= 2147483647="" and="">= 0 Output The first line will contain a message prompt to input the size. The succeeding lines will contain a message prompt to input the elements of the array. The last line will contain the largest sum of an ascending sequence of the array. Enter the size: 6 Enter element #1: 2 Enter element #2: 4 Enter element #3: 5 Enter element #4: 1 Enter element #5: 7 Enter element #6: 3 Largest sum = 11