Tag Archives: combinatorics
Acknowledgements So this problem seems suite simple. After some thinking I came up with the idea that C(n,k)*(n-k-1)! would give me the number of combinations with exactly k correct wines out of n glasses. Infact C(n,k) is the number of … Continue reading
At first this problem puzzled me because the example: x.x.x.x.x x…x.x x…x.x.x x.x…x x.x.x.x.x G ‘x’ indicates a peg, ‘.’ indicates empty space. For me gave a solution of 0.63.
Peg Game description from Facebook hacking cup. Continue reading