## Filling Time -- Problem M (50 points)
The input file for this problem is called PROBLEMM.DAT. Each line of the file contains two integers, the first being the amount of fuel available at a town and the second being the amount of fuel needed to reach the next town. Both of these numbers will be positive and no more than l 00. The first line gives the information for the starting town; the remaining (non-zero) lines give the information for the first N-1 towns. The file is terminated by a line containing two zeroes. Output, which must be written to standard output (the screen), must be the least number of refuelling stops necessary, left justified. Note that, since the truck starts empty, the answer is at least l. You should assume a solution always exists.
## Example Input37 10 11 12 25 13 20 4 12 8 27 15 0 0 ## Example Output2 |