chrome's blog

Topcoder Single Round Match 672
By chrome, 9 years ago, translation, In English

Hi there!

Tomorrow at 04:00 MSK will be held Topcoder SRM 672.

Let's discuss problems there, after contest.

UPD: Editorial

  • Vote: I like it
  • +98
  • Vote: I do not like it

»
9 years ago, # |
  Vote: I like it +4 Vote: I do not like it

Registration is open. GO!

→ Reply
»
9 years ago, # |
← Rev. 2   Vote: I like it +25 Vote: I do not like it

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.

→ Reply
  • »
    »
    9 years ago, # ^ |
      Vote: I like it +25 Vote: I do not like it

    Are there any non-connected almost Eulerian graphs?

    → Reply
  • »
    »
    9 years ago, # ^ |
    ← Rev. 3   Vote: I like it +5 Vote: I do not like it

    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

    → Reply
»
9 years ago, # |
  Vote: I like it 0 Vote: I do not like it

How to solve Div.1 500?

→ Reply