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

  • + 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)...