Friday, 4 February 2011

Quite a bit

Friday, 4 February 2011 22:16
skiminok: (Default)
Выдержка из одного эдиториала TC.

We then need to count the number of maximum matchings in this graph, and then we're done. Unfortunately, this is a #P-complete problem, and if we can solve it in polynomial time, we would have proved that P = NP. That would make this problem quite a bit trickier than the usual Division 1 Medium.

Слова, вынесенные в заголовок, отправили меня ржать под стол :D Почти буквально)

Profile

skiminok: (Default)
skiminok

Most Popular Tags

Page Summary

July 2011

S M T W T F S
     12
3456789
10111213141516
17181920212223
242526272829 30
31