Juice Machines

Problem Statement

Juice Machines Problem Description Cars in Wonderland run on strawberry juice. Suppose there is a circle, and there are m juice machines on that circle. You are given an array of data in pairs: 1. The amount of juice that every juice machine has 2. Distance from one juice machine to the next Your task is to find the first point/station from where a car will complete the circle, i.e., visit all the stations and return to the starting one (out of the given, point starts from 0). The car will stop at each juice machine and has infinite capacity. It will keep going in the same direction. Note: Assume that for one liter of juice, the car can go one unit of distance. Input Format: The first line of input will contain an integer N, representing the size of the array. So, the total number of juice machines will be m = N/2. The second line of input will contain N space-separated values of an array, representing the N/2 pairs(m) of values. Each pair contains the juice machine's amount of juice a