Блог пользователя byte_gambler

Two problems
Автор byte_gambler, 10 лет назад, По-английски

Hello, Can u guys help me with the following two problems.

https://www.hackerrank.com/challenges/even-tree

http://www.codechef.com/problems/ADIGIT

Thanks in advance.

  • Проголосовать: нравится
  • +3
  • Проголосовать: не нравится

»
10 лет назад, # |
  Проголосовать: нравится +6 Проголосовать: не нравится

Two blog posts :D

Even tree: notice that you can't remove any edges connecting the leaves to the rest of the tree, so merge the leaves into their parents (for each parent, say that if it "contained x vertices", then it'll "contains x + 1 vertices" from now on, starting with x = 1) and you get another tree, in which you can again decide for each "leaf" whether the edge from it should be removed or not based on parity of x.

ADIGIT: think how the solution will look for K=1,2,3.

→ Ответить
»
10 лет назад, # |
  Проголосовать: нравится +3 Проголосовать: не нравится

Hey, Can you elaborate more on how to code it!!

→ Ответить
  • »
    »
    10 лет назад, # ^ |
      Проголосовать: нравится +3 Проголосовать: не нравится

    Codechef problems have editorials and I think Hackerrank has, too. Try reading the editorial, or actually thinking about what I said and trying to make your own solution based on it.

    → Ответить