Vasu_'s blog

Invitation to SmallForces Monthly Contest #2
By Vasu_, history, 18 months ago, In English

Hello coders,

I am glad to invite you to the SmallForces Monthly Contest #2 which will be held on [contest_time:443861]. Registrations will start 6 hours before the contest.

Difficulty of the problems are between Div.2 and Div.3.

All the problems were authored and prepared by Vasu_, Jalppatel1428 and naisheelpatel. You will have 150 minutes to solve 7 problems.

We would like to thank:

We strongly recommend you to read all the problems once.

We have tried our best to create some good problems. So, I hope you'll enjoy the round and find some problems you like :)

Link to the SmallForces group.

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

Comments Comments (6)
| Write comment?
»
18 months ago, # |
  Vote: I like it +3 Vote: I do not like it

I'm unable to open contest.

→ Reply
»
18 months ago, # |
← Rev. 3   Vote: I like it -6 Vote: I do not like it

Editorial when?

EDIT- Why was it downvoted? I had a genuine question as I was stuck in a problem, it feels like there is a gang against me who is downvoting all the comments by me. Please stop. Have a life!

→ Reply
»
18 months ago, # |
  Vote: I like it 0 Vote: I do not like it

in https://codeforces.net/gym/443861/problem/F
when given a general graph with all w = 1,
if ans is 1, then there exist a hamiltonian cycle
otherwise not
So does this solve hamiltonian cycle problem in linear
Or did i read the qs wrong?

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

    it's a Euler path not hamiltonian cycle.

    The difference is that one is for edge and the other is for node.

    → Reply
    • »
      »
      »
      18 months ago, # ^ |
      ← Rev. 2   Vote: I like it 0 Vote: I do not like it

      Oops. Sorry, yeah it's Euler path. I confused it with Hamiltonian. :'-(

      → Reply
»
18 months ago, # |
← Rev. 3   Vote: I like it 0 Vote: I do not like it

[problem solved]

→ Reply