The distance between the towns A and B is 1000 miles. There is 3000 apples in A, and the apples have to be delivered to B. The available car can take 1000 apples at most. The car driver (or perhaps someone accompanying him) has developed an addiction to apples: when he has apples aboard he (or she) eats 1 apple with each mile made. Figure out the strategy that yields the largest amount of apples to be delivered to B.

Generalize the strategy for an arbitrary amount of apples.

from: https://www.math.utah.edu/~cherk/puzzles.html

shit like this is why stem majors are stereotyped as autismos
obviously the best strategy is to get a new driver/helper

P8076
You will [bold: NOT] deny Holo her apples.

why is the answer is what it is

P8055
Impossible given the current restraints. Just get a driver/helper whose not a thieving minority.

microprocessor nonoko 833

P8114
got the same