Task 451
Task 451: development task in emrekuruu/math-openenv, an RL environment on the Hugging Face Hub. Harry, Ron and Neville are having a race on their broomsticks. If there are no ties, in how many different possible orders can they finish?
The task
Harry, Ron and Neville are having a race on their broomsticks. If there are no ties, in how many different possible orders can they finish?