This problem is way to easy for a 5 kyu rating in C#.

For this to be more appropriate to the given situation, it is impotant to consider DNS and DNF results which are when the solver Did Not Start or Finish their solve. Those times are automatically the worst time, and if they get 2 or more in 1 round they do not get an average.

I would suggest passing these in as negative values.

The exaple test for C# does not work, you need to write your own examples. The actual test passes way to easily. I tried out (b==1)?2:8 and it worked as the only test cases are (2,1) and (2,4).

Something is not working for the C# version, can't even attempt as the languange doesn't stay selected.

Hi

Thanks for the advise, have modified the problem/solution to implment the Tuples.

I do still prfer Stack over HashMap though. Given that the disks will natrally be in order, and will have to be accessed Last in First out I think they are appropriate. Are their advantages of HashMap I am not seing?

Thanks
Damo