Hi there!
Tomorrow at 04:00 MSK will be held Topcoder SRM 672.
Let's discuss problems there, after contest.
UPD: Editorial
Hi there!
Tomorrow at 04:00 MSK will be held Topcoder SRM 672.
Let's discuss problems there, after contest.
UPD: Editorial
# | User | Rating |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 165 |
3 | adamant | 161 |
4 | TheScrasse | 160 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 152 |
8 | orz | 146 |
9 | SecondThread | 145 |
9 | pajenegod | 145 |
Name |
---|
Registration is open. GO!
For more than half an hour I tried to count connected almost Eulearian graphs in Div1-500 =( Didn't realize this is not a condition we need.
Upd: oops, that's pretty non-sense. Now I even can't myself understand what I was counting.
Are there any non-connected almost Eulerian graphs?
Initially I was counting connected graphs with at most 2 vertices having odd degree (*). After this solution failed on samples I realized that in addition to almost Eulerian graphs I also counted graphs with 1 bridge which fall into 2 Eulerian graphs after removal of this bridge. Luckily, it's possible to count AE graphs just from knowing (*) for all N. Maybe you made the same mistake as me initially?
UPD: initial version of the comment was wrong
How to solve Div.1 500?
Editorial link: http://codeforces.com/blog/entry/21112