O--O's blog

Invitation to TheForces Round #12 (Double-Forces) [New Round] [GYM]
By O--O, history, 21 month(s) ago, In English

Hello, Codeforces!

We are happy to invite you to TheForces Round #12 (Double-Forces), which will take place on Apr/28/2023 18:10 (Moscow time)

What is TheForces Round?

Editorial is out.

You will have 150 minutes to solve 6 problems.Two of the problems are divided into two subtasks respectively.

We strongly recommend you to read all statements.

Note the duration is 2.5h and strongly recommend reading all problems once.

Discord Server (600+ people)

Contests' archive

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

Comments Comments (15)
| Write comment?
»
21 month(s) ago, # |
← Rev. 2   Vote: I like it +36 Vote: I do not like it

As the setter, I hope you will enjoy the round :)

→ Reply
»
21 month(s) ago, # |
  Vote: I like it -62 Vote: I do not like it

As a tester give me negative contribution! :)

→ Reply
  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it +35 Vote: I do not like it

    As a tester give me positive contribution! :)

    → Reply
»
21 month(s) ago, # |
  Vote: I like it +29 Vote: I do not like it

As a tester, I love testing

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +29 Vote: I do not like it

What's the approximate difficulty of this round?

→ Reply
  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it +8 Vote: I do not like it

    Imo it's a DIV2.5 round,suitable for $$$[0,2100]$$$ guys :)

    → Reply
»
21 month(s) ago, # |
  Vote: I like it +30 Vote: I do not like it

As a tester, hope you'll enjoy! Harder than the former ones i guess lol!

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +19 Vote: I do not like it

excited

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +12 Vote: I do not like it

Waiting for an official round sire :)

→ Reply
»
21 month(s) ago, # |
  Vote: I like it +5 Vote: I do not like it

There is about an hour left before the contest starts and we welcome your registration :)

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

As a tester, I tested. Hope yall will enjoy the round!

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

Good problemset (could do only 4 as came 40min later :( )
BTW Any idea about D how to do it?

→ Reply
»
21 month(s) ago, # |
  Vote: I like it 0 Vote: I do not like it

For C2 any hints please

My idea (sum-p1-pn)%(n-1) = 0 we need to find correct pn

→ Reply
  • »
    »
    21 month(s) ago, # ^ |
      Vote: I like it 0 Vote: I do not like it

    This equation is correct. By observing this equation, you know that there may be up to three valid $$$p_ {2n}$$$.

    → Reply