## Search found 6 matches

Tue Sep 12, 2006 7:43 am
Forum: Volume 110 (11000-11099)
Topic: 11088 - End up with More Teams
Replies: 30
Views: 17118
Larry wrote:Seems like most of the memo's got around 1 second. Just memo on the state..
I got AC in 0.023 using memoization thx...
Tue Sep 12, 2006 2:51 am
Forum: Volume 110 (11000-11099)
Topic: 11088 - End up with More Teams
Replies: 30
Views: 17118
is it that ppl who solved it in less than 1s or .002 sec have solved it using backtracking.. I myself solve it using dp... more apt would be memoization... :lol: I takes >1s ,precisely 1.094.. :wink: I tried it using back-tracking, and DP like O(2^n), but I got TLE :( I want to show your solution -...
Mon Apr 17, 2006 6:38 pm
Forum: Other words
Topic: List of shortest path problem
Replies: 7
Views: 3730
Moha wrote:Think about it with Floyd or Bellmanford.
Huh, Really? I wonder why the problem is to find shortest path...
Mon Oct 31, 2005 8:14 am
Forum: Volume 109 (10900-10999)
Topic: 10951 - Polynomial GCD
Replies: 7
Views: 3669

### 10951 - Polynomial GCD

I can't approach to this problem.

Plz someone help me...
Sun Oct 30, 2005 3:51 pm
Forum: Volume 109 (10900-10999)
Topic: 10957 - So Doku Checker
Replies: 31
Views: 14638
To find how many solution in inputs, it maybe works O(|blanks|^9) This is quite obviously false. In fact, finding the exact count of sudoku boards was quite a difficult problem and solving it took the mathematical community quite a while. As far as I know, there's still no known closed form formula...
Sun Oct 30, 2005 12:05 am
Forum: Volume 109 (10900-10999)
Topic: 10957 - So Doku Checker
Replies: 31
Views: 14638
I solved it by BackTracking...

To find how many solution in inputs, it maybe works O(|blanks|^9)