I have a question regarding Aspen Avenue:

The problem says errors should be within 10^-6 absolute and relative error, but i suspect the judge actually does a string match or has calculated it's test values with sub-optimal precision. Thus one must calculate the answer in the same way as the judge, rather than actually being within error bounds. Are Aspen Avenue's test cases really correct?

A similar problem occurred in ljutnja where the answer must be cast to a 64 bit unsigned integer so that it overflows to an erroneous answer, thus matching the test data and giving a "correct" answer on Kattis.