Maximum Consecutive Products within Budget

Problem Statement

Maximum Consecutive Products within Budget Problem Description Reeta loves spending time on Shopping and, most of all, she loves spending time in shopping malls. This time Reeta has decided to spend a very limited money on shopping and made plan to stop herself from overspending. she has the budget of X amount of money. The store she visited has n-numbers of items to buy. Reeta's plan: She decided that, this time she won't wonder in store for comparing the products all she would do is, she will find sets of consecutive products which are in row and buy as much as she could. With a program, help Reeta to identify the consecutive product such a way that she could buy the maximum number of products within the budget. Read the input from STDIN and write the output to STDOUT. You should not write arbitrary strings while reading the input and while printing as these contribute to the standard output. Constraints 3 > |arr[n]| > 200 3 > |x| > 100 3 > |n| > 200 Input Format Th