You are viewing a single comment's thread. Return to all comments →
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)...
Seems like cookies are disabled on this browser, please enable them to open this website
Project Euler #181: Investigating in how many ways objects of two different colours can be grouped.
You are viewing a single comment's thread. Return to all comments →
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)...