20-CS-122-001 Computer Science II Spring 2012
Race Circuit

Virtual functions, classes, inheritance, lists, queues, stacks, applications

Problem:
    There are a number of fueling stations located at various points around a race circuit. Suppose the amount of fuel at each fueling station is different but that the total fuel around the circuit is exactly what is needed by a race car to make one complete circuit. Find the fueling station from which the race car may begin traversing the circuit with an empty tank and not run out of fuel.

Idea:
    In pictures