An interesting puzzle straight from CMU
If only significance of 3775 is that it's an odd number I have a case where n = 2 and number of guests = 3, where is is not possible to find top 2 dishes.
Ordering:
1 -> 1 2 3 4
2 -> 2 3 4 1
3 -> 3 4 1 2
If we select a dish with 2^(n - 1) -1 victories, how does that imply we can place it in top n dishes?
Now this was a really interesting problem
If only significance of 3775 is that it's an odd number I have a case where n = 2 and number of guests = 3, where is is not possible to find top 2 dishes.
Ordering:
1 -> 1 2 3 4
2 -> 2 3 4 1
3 -> 3 4 1 2
If we select a dish with 2^(n - 1) -1 victories, how does that imply we can place it in top n dishes?
Now this was a really interesting problem