Project Euler #181: Investigating in how many ways objects of two different colours can be grouped.

Sort by

recency

|

10 Discussions

|

  • + 0 comments

    How tf is this tagged "easy"?

  • + 0 comments

    CAnt i see the test cases?

  • + 1 comment

    I think I have an time efficient alogrithm in python O(m²n²) but yet I can compute only up to (m,n) = (100,100)...

  • + 0 comments

    Apparently you get 90.9 out of 100 points just for solving testcase #1.

  • + 0 comments

    Use beggars's Method of permutations and combinations