Psychotic_D's blog

Mashup Contest ! Beginner friendly Div 3.5 style
By Psychotic_D, 2 years ago, In English

Hello Everyone!!

Me (Psychotic_D) and my friend E404_Not_Found have been prepared another training round after a long time and we will be so happy if you participate in it! The contest will be held on [contest_time:415092].

Also we thanks chromate00,iliya_mon for testing the round and giving invaluable feedback to prepare a good mashup.

It's a beginner-friendly mashup contest for training around Div 3.5 style and is suitable for beginners and newcomers so make sure you registered for the contest.

Here is the link of the contest.

You will be given 7 problems and 120 minutes to solve them.

UPD: Contest registration has been started.

UPD: Editorial is out now.

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

Comments Comments (17)
| Write comment?
»
2 years ago, # |
  Vote: I like it 0 Vote: I do not like it

Auto comment: topic has been updated by Psychotic_D (previous revision, new revision, compare).

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

Please make sure that submissions can be viewed after the contest unlike some of the gym contests

→ Reply
»
2 years ago, # |
  Vote: I like it +1 Vote: I do not like it

~5 minutes to start!

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

Beginner: A kind of Codeforces user who knows algorithms like prime sieve and graph DFS

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

    Bro, We said it's like Div.3.5, even in Div.4 there are some Graph problems.

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

      Didn't we need sieve in G?

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

        My bad, The author of that problem was not me, You're right.

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

        Yes but atleast last probablems in div.4 are graph probablems and as we mentioned it's div.3.5 so I think it's ok.

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

      It's just a joke and I solved all problems (also graph dfs in square grid is not too complicated)

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

It was a good contest with logical problem set, and I really appreciate that.

→ Reply