This site uses different types of cookies, including analytics and functional cookies (its own and from other sites). To change your cookie settings or find out more, click here. If you continue browsing our website, you accept these cookies.
We've recently made an accessibility improvement to the community and therefore posts without any content are no longer allowed. Please use the spoiler feature or add a short message in the message body in order to submit your weekly challenge.
We are currently experiencing an issue with Email verification at this time and working towards a solution. Should you encounter this issue, please click on the "Send Verification Button" a second time and the request should go through. If the issue still persists for you, please email firstname.lastname@example.org for assistance.
The "static" solution is easy enough, but the "dynamic" solution took me longer than expected. It's a good challenge to refresh knowledge of the dynamic tool. Thank you @mst3k for submitting this challenge.
Extra credit: The number of possible outcomes is n! (n factorial). So, if there were five horses, the number of outcomes would be 5! = 5 x 4 x 3 x 2 x 1 = 120.
Iterative macro: This seems way too long to do something so simple, however, removing the duplicates (e.g. horse 1 = horse 2) after each iteration was MUCH faster than removing them after all of the iterations completed (because those unnecessary records multiply quickly!)