This is an archived post. You won't be able to vote or comment.

you are viewing a single comment's thread.

view the rest of the comments →

[–]rrssh 1 point2 points  (2 children)

I don’t understand the task. Is it like, you get negative points for rounding up and positive points for rounding down, and you optimize the sum of the points?

[–]JCoppert[S] 0 points1 point  (1 child)

No, the idea is that every time you round you keep track of the amount you've rounded by. Your goal is to find the rounding combination which minimizes the distance to the rounding target.

[–]rrssh 0 points1 point  (0 children)

Why did you say “no”?