Problem author: Kniaz.

Problem author: Kniaz.

Problem author: Kniaz.

Problem author: HEARTOWAVE.

Problem author: Kniaz.

Problem author: Kniaz.

Problem author: HEARTOWAVE.

Problem author: Kniaz.

# | User | Rating |
---|---|---|

1 | tourist | 3803 |

2 | jiangly | 3707 |

3 | Benq | 3627 |

4 | ecnerwala | 3584 |

5 | orzdevinwang | 3573 |

6 | Geothermal | 3569 |

6 | cnnfls_csy | 3569 |

8 | Radewoosh | 3542 |

9 | jqdai0815 | 3532 |

10 | gyh20 | 3447 |

# | User | Contrib. |
---|---|---|

1 | awoo | 162 |

2 | maomao90 | 160 |

3 | adamant | 157 |

4 | maroonrk | 154 |

5 | -is-this-fft- | 150 |

6 | Petr | 148 |

6 | SecondThread | 148 |

8 | atcoder_official | 147 |

9 | TheScrasse | 145 |

9 | nor | 145 |

Tutorial is loading...

Problem author: Kniaz.

Tutorial is loading...

Problem author: Kniaz.

Tutorial is loading...

Problem author: Kniaz.

Tutorial is loading...

Problem author: HEARTOWAVE.

Tutorial is loading...

Problem author: Kniaz.

Tutorial is loading...

Problem author: Kniaz.

Tutorial is loading...

Problem author: HEARTOWAVE.

Tutorial is loading...

Problem author: Kniaz.

Hello everyone!

On April 28, the II Olympiad of School 54 in Programming took place.

Today, on April 30, 2023, 18:05 UTC, I will host a mirror of this Olympiad.

There will be 8 problems offered and 3 hours to solve them.

The difficulty of the contest is at the Div 2-3 level.

The Olympiad is conducted in IOI format with the following rules:

Each problem is worth 100 points, of which 70 points are awarded for passing individual tests set by the jury (1 point for each test), and 30 bonus points are given if the program passes all tests set by the jury. The tests presented in the problem statement do not earn points, but passing them is necessary to test the main group of tests. Time and the number of submissions do not affect the Olympiad results. The maximum score obtained from all submissions is assigned for each problem.

Acknowledgments to the people who made this round possible:

- Thanks to HEARTOWAVE and vbobrov for providing two problems that made the round even more interesting.

- Thanks to testers: vbobrov, BlackDwek, ZooMo, Cyanprism, as well as awoo and his team soup, Minder, ermukanoff, and Sayleyd. Thanks to all of you, the problems have become much better.

- I thank Squantus for listening to and discussing problems throughout the year.

- Special thanks to the team of the Center for Pedagogical Mastery (CPM) for providing the technical capability to conduct the Olympiad as an offline event at the highest level.

- Thank you, MikeMirzayanov, for the wonderful Codeforces and Polygon systems, which make it extremely convenient to conduct competitions.

**I strongly request that those who are already familiar with at least one task from the Olympiad do not participate. This includes, but is not limited to, participants of the on-site Olympiad of School 54 and participants of the MPSU Olympiad of 2023.**

**Congrats to the winners!**

I FelixArg

II BallBreaker

III iiand

III ProdipDatta

III jliu12

III 1_2_3_4_5_9

Today at Polynomial Round 2022 (Div. 1 + Div. 2, Rated, Prizes!) I came up with a test that hacks my solution and many others, however, it turns out that in the rounds with a premium for hacking (i.e. not Educational or Div3-4) you can't hack yourself. This is logical, because you can score points by writing a solution only for pretests and hack yourself by scoring at least a few points, you can't solve the problem completely.

However, lately it has been difficult to write a banal solution for pretests, which is obviously not correct.

But still, I would like to have at least some advantage from hacking myself, because just sitting and waiting for you to be hacked is scary, especially if the hacker overtakes you on your own hacking. I expected that the people I hacked and corrected the error would go looking for the same error in my code.

In general, I suggest making it possible to hack yourself, without a bonus, in order to somewhat compensate for your mistake, since you realized that the decision is not correct, then at least no one will overtake you on it. Of course, for people who are not in the TOP 100, the loss of one position will not greatly affect the rating, but it is still a matter of hacking policy.

What do you think about it?

Tutorial is loading...

Problem author: MikeMirzayanov.

Tutorial is loading...

Problem author: MikeMirzayanov, Kniaz.

Tutorial is loading...

Problem author: Kniaz.

Tutorial is loading...

Problem author: MikeMirzayanov, Kniaz.

Tutorial is loading...

Problem author: Kniaz.

Tutorial is loading...

Problem author: Kniaz.

I want to thank Mikhail Piklyaev (awoo) for translation of tutorial!

Tutorial of Codeforces Round 392 (Div. 2)

Hello everybody!

I am glad to announce that at 19 January 2017 18:05 MSK will take place Codeforces Round #392 for participants of Div.2. Participants from the Div.1 may participate out of the competition as usual.

You will be offered 6 problems and 2 hours for solving them.

Great thanks to Nikolay Kalinin (KAN) and Alexey Vistyazh (netman) for their help with the contest preparation, Tatiana Semenova (Tatiana_S) for translating the statements and Mike Mirzayanov (MikeMirzayanov) for the Codeforces and Polygon systems and also for help with ideas of some problems and their preparation.

It's my second round and I hope that you like it more than the previous one. Fair rating to everyone!

**UPD: Scoring 500 — 1000 — 1500 — 1750 — 2500 — 3000.**

**UPD: Editorial!!! I want to thank Mikhail Piklyaev (awoo) and Tatiana Semenova (Tatiana_S) for translation of tutorial!**

**Congrats to the winners!**

Div. 2

I wolf29

II alexwice

III WhyamIhere

4 TaTaPiH

7 djqtxdy

8 whzzt

9 Lucas97

10 Clayton

Div. 1

I W4yneb0t

II sd0061

III irkstepanov

4 wolf29

8 kmjp

Announcement of Codeforces Round 392 (Div. 2)

I'm sorry for a delay with publishing the editorial.

Tutorial is loading...

Problem author: MikeMirzayanov.

Tutorial is loading...

Problem author: MikeMirzayanov, Kniaz.

Tutorial is loading...

Problem author: MikeMirzayanov.

Tutorial is loading...

Problem author: MikeMirzayanov, Kniaz.

Tutorial is loading...

Автор задачи: Kniaz.

Tutorial is loading...

Автор задачи: MikeMirzayanov.

I want to thank Mikhail Piklyaev (awoo) for translation of tutorial!

Tutorial of Codeforces Round 378 (Div. 2)

Hello!

Next Codeforces round #378 for participants from the second division will take place on October 31, 2016 at 17:05 MSK(Moscow time). Traditionally, participants from the first division are able to participate out of the contest.

This round will be unusual:participants will be given six problems and two and a half hours to solve these problems. Pay attention to the unusual time of the beginning of a round!

I want to thank Nikolay Kalinin (KAN) for help with preparation of this round, Tatiana Semenova (Tatiana_S) for translation of statements and Mike Mirzayanov (MikeMirzayanov) for great Codeforces and Polygon systems and also for the help in preparation of a contest and the ideas for several tasks.

It is my first round and I hope you will appreciate it.

The scoring is 500-1000-2000-2000-2750-3000.

Congrats to the winners!

Div. 2

Div. 1

Announcement of Codeforces Round 378 (Div. 2)

Codeforces (c) Copyright 2010-2024 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Jul/15/2024 18:53:25 (g1).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|