Author: GreenGrape

Author: GreenGrape

Author: GreenGrape

Author: GreenGrape

Author: ashmelev

Author: Errichto

Author: lewin

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

1 | tourist | 3557 |

2 | Um_nik | 3494 |

3 | Radewoosh | 3344 |

4 | wxhtxdy | 3309 |

5 | LHiC | 3302 |

6 | Benq | 3286 |

7 | mnbvmar | 3274 |

8 | Petr | 3254 |

9 | yutaka1999 | 3190 |

10 | ksun48 | 3170 |

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

1 | Errichto | 191 |

2 | Radewoosh | 180 |

3 | PikMike | 166 |

4 | Vovuh | 165 |

5 | antontrygubO_o | 164 |

6 | rng_58 | 161 |

7 | Um_nik | 156 |

7 | majk | 156 |

9 | 300iq | 155 |

10 | farmersrice | 151 |

Author: GreenGrape

Tutorial is loading...

Author: GreenGrape

Tutorial is loading...

Author: GreenGrape

Tutorial is loading...

Author: GreenGrape

Tutorial is loading...

Author: ashmelev

Tutorial is loading...

Author: Errichto

Tutorial is loading...

Author: lewin

Tutorial is loading...

Hello.

On Aug/19/2018 16:35 (Moscow time), Codeforces Round #505 takes place. This is a paired round to #504.

Some problems are taken from VK Cup 2018 Finals (ashmelev, Errichto, lewin) and some are proposed by me. I'd like to thank my fellows — Dima (_kun_) who is actually coordinating this round, Kolya (KAN) who brought me here, and also Grisha (gritukan) and Ildar (300iq) just for being nice.

I'd also like to express my gratitude to MikeMirzayanov for multiple bug fixes and awesome Codeforces!

There will be **seven** problems will the following scoring:

500 — 1000 — 1500 — 1750 — 2250 — 2750 — 3500

**UPD.** The system testing is over. Editorial (with problem E now)

Congratz to the winners!

- Swistakk (after all these years, yay)
- CongLingDanPaiShang3k5
- Kostroma
- Benq
- AwD
- xumingkuan
- mcfx
- fjzzq2002
- Egor
- kriii

As in the previous round, thanks to VK social network, GP30 scores will be distributed among the best participants.

Participants are sorted by sum of points for both rounds (if the participant did not participate in one of the rounds, the points scored for it are assumed to be equal to zero), with the maximum time for both rounds from the beginning of the round to the last submission that passed the pretests as tie-break.

Let me remind you that top 10 participants with respect to GP30 score will receive a plush Persik.

Hope you enjoy. Good luck and have fun!

Всем привет!

В тренировки добавился XI Открытый Кубок СПбГУ по программированию среди школьников, который состоялся сегодня, 29 апреля.

Над задачами работали _kun_, admarkov, Gassa, Glushen, GreenGrape, gritukan, ivanovmp, mathsux, PolyProgrammist, rek, sinesight, tunyash.

Продолжительность виртуального контеста — 4 часа. К сожалению, по техническим причинам портировать задачу D не получилось, так что для сдачи она, увы, недоступна.

Будем надеяться, что вам понравится :)

Разборы и авторские решения можно найти здесь.

Tutorial of Codeforces Round #471 (Div. 2)

Tutorial of Codeforces Round #471 (Div. 2)

*Less than 24 hours till the round?*

*And still no announcement?*

*How come, Mr. Grape?*

Codeforces Round #471 will take part on Friday at 19:35 MSK. Note that the duration is a bit longer that usual.

The round will be **rated** for all division 2 participants. Division 1 is welcome aswell :)

My gratitude to Grisha (gritukan) for round coordination, Ildar (300iq), Nikita (neckbosov), Azat (ismagilov.code), Eugene (rek) and Oleg (x3n) for testing and Mike (MikeMirzayanov) for awesome Codeforces and Polygon.

There will be **six** problems with the following scoring:

500 — 1000 — 1500 — 2000 — 2500 — 3000

**UPD.** System testing is over. Editorial

Congratz to the winners!

*Div. 2:*

*Div. 1 (unofficial):*

Announcement of Codeforces Round #471 (Div. 2)

Announcement of Codeforces Round #471 (Div. 2)

Note that the number of hacks is palindromic!

Tutorial is loading...

**Code:** 35036267

Tutorial is loading...

**Code:** 35036334

**Code** (bless pragmas): 35036420

Tutorial is loading...

**Code:** 35036537

Tutorial is loading...

**Code:** 35053688

Tutorial is loading...

**Code** (backward dp): 35036591

**Code** (forward dp): 35036674

Tutorial is loading...

Note that the solutions might not fully match the editorial, though the ideas are still the same.

**Code** (GreenGrape): 35055945, 35055961

**Code** (KAN): 35055995

**Code** (x3n): 35055977

Tutorial of Codeforces Round #461 (Div. 2)

Tutorial of Codeforces Round #461 (Div. 2)

*Hello, Codeforces! Haven't seen ya for a while :D*

Codeforces Round #461 will take place on Wednesday, 20:15 MSK. Note that the round is scheduled a bit later than usual.

The round will be **rated** for all division 2 participants. Division 1 is heartly welcome aswell :)

My gratitude to Kolya (KAN) for round coordination, Grisha (gritukan), Oleg (x3n), AmirReza (Arpa) and Senya (senek_k) for testing and Mike (MikeMirzayanov) for awesome Codeforces and Polygon. A special thanks goes to Dima (mitterr1999) and Camille (pseuda) for sharing a problem sketch with me.

The main character of this round will be **Imp** the playful monster. Yet the statements are guaranteed to be short :)

There will be **six** problems with the following scoring:

500 — 1000 — 1250 — 1500 — 2000 — 2750

GL & HF!

**Note that the round has been moved 40 minutes later to avoid clashing with CSAcademy Round.**

**UPD.** The contest is over. Well...

**UPD.** System testing is over! Editorial.

Congratz to the winners!

*Div. 2:*

*Div. 1 (unofficial):*

**UPD.** The complete editorial is out (D/F).

Announcement of Codeforces Round #461 (Div. 2)

Announcement of Codeforces Round #461 (Div. 2)

*Hey, Codeforces!*

Hope that the last few days were quite productive for all of you in terms of rest and pleasure. Time to forget about messing with handle colors and get back to coding!

I'm proud to usher the first contest of the year — Codeforces Round #456, which is going to be held on Friday, 17:35 MSK. The round will be **rated** for all division 2 participants. Anyway, we will be glad to see whoever decides to join us out-of-competition :)

The authors are — GreenGrape and rek (don't worry, it's all about New Year magic ^^). My heartfelt gratitude to Kolya (KAN) for his invaluable help in round coordination, Grisha (gritukan) and Oleg (x3n) for testing and correcting statements, Dima (cdkrot) and Gleb (glebodin) for preliminary solving, AmirReza (Arpa) for close reading and Mike (MikeMirzayanov) for awesome Codeforces and Polygon platforms.

We look forward to brightening up your cold winter evening :)

GL & HF!

**UPD.** There will be **five** problems with the following scoring:

500 — 1000 — *1750* — 2000 — 2500

As usual, it's strictly recommended to look through all problems :)

**UPD.** Please note that the registration was delayed for a few hours.

**UPD.** The contest is over.

It turned out to be a little bit more complicated than we expected. Still we hope you learned something new :)

**UPD.** Editorial!

**UPD.** Congratulations to the winners!

*Div. 2:*

*Div. 1 (unofficial):*

Announcement of Codeforces Round #456 (Div. 2)

We, the round authors, are eternally grateful to all the brave who took part in this round. Sadly there were some issues to encounter, but we hope it only made the contest more interesting :)

Tutorial is loading...

**Code**: 29027824

Tutorial is loading...

**Code**: 29027867

Tutorial is loading...

**Code**: 29027782

Tutorial is loading...

**Code** (divide & conquer, GreenGrape) 29027705

**Code** (divide & conquer, x3n) 29027883

**Code** (lazy propagation) 29027667

Tutorial is loading...

**Code**: 29027757

Tutorial is loading...

Tutorial is loading...

**Code**: 29027876

Tutorial of Codeforces Round #426 (Div. 1)

Tutorial of Codeforces Round #426 (Div. 1)

Tutorial of Codeforces Round #426 (Div. 2)

Tutorial of Codeforces Round #426 (Div. 2)

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/14/2019 02:54:55 (f3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|