→ Обратите внимание
До соревнования
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + Div. 2)
23:11:37
Зарегистрироваться »
WorldQuant Round 1 (Codeforces Round 1128, Div. 1 + Div. 2)
23:11:37
Зарегистрироваться »
*есть доп. регистрация
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | jiangly | 3670 |
| 3 | Kevin114514 | 3657 |
| 4 | maroonrk | 3355 |
| 5 | Um_nik | 3353 |
| 6 | squareOf105 | 3346 |
| 7 | tourist | 3343 |
| 8 | strapple | 3324 |
| 9 | heuristica | 3322 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 158 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | AmShZ | 143 |
| 4 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | adamant | 137 |
| 8 | BledDest | 134 |
| 9 | maroonrk | 133 |
| 10 | qwexd | 130 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 16.10.2026 18:23:24 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
I am not Chinese, but I know that on the most problems google translate works well (not very well, but at least I am able to read the statements)
You can find some in PEG Judge. (Though the problems are pretty old)
Now you can find the same thing in acmicpc.net too!
Thanks! But they are in Korean :P >_<
The problem statements are in English. https://www.acmicpc.net/category/303
Do you still need it? We can send you PDF, if you need the translate of one problem, I can try to give you a brief.
But Chinese problems now tend to be too long to understand.
For example, [NOI2014]Zoo [NOI2016]A Great Calculation in the Fields, and nearly all problems from Ynoi.
And [SDOI2010] Pig Kingdom Kill
But if you don't care about the pictures in Ynoi.
They are short.
But pictures are the core of Ynoi for people who can't solve them!
Thanks a lot! But I just want to take a glance at how Chinese problems look like. Are they difficult or do they have some special/fun points?
Compared to the European and American problems, Chinese problems may be harder(I think at least not easier). Because these questions are generally not purely intellectual problems, you need to learn some Large algorithm. For example, as a problem with 998244353, it may need you to learned Lagrangian Interpolation, FFT to implementate code, and as a problem with string, it may need you to use SAM + SegTree/TreeSplit, and so on. At all I think Chinese problems very investigating intellect and code implementation. (Mainly probably China's FFT problems was quite a lot)
You can get NOI problems in BZOJ, they are in exam original PDF. (They have not upload NOI2019 yet)
Almost every OJ from China have these problems. such as Luogu
But they are in chinese.
Emm, are you sure foreign can enter the website of China...
even though I'm not Chinese, I still can enter it without any need of VPN
Oh, ok. O(∩_∩)O
This is not North Korea.
There's another series of problems in China called NOIp(NOI in provinces).The problems are easier and it's the the first round of contests in one session.
Somehow related: Can someone post the most popular Chinese Online Judges?
Luogu
UniversalOJ
LibreOJ
BZOJ
Side note, most problems from BZOJ requires payment. (About $$$100$$$ dollars per year, increasing rapidly).
Side note, be patient while using BZOJ. That thing is extremely slow and unstable.
I think it's OK.At least faster than SPOJ or something.And its problems are amazing.
yeah, SPOJ is totally unbearable.
and I have to admit BZOJ's problems (and discusses) are amazing.
But, we have to say, a great number of the private problems can be found in other OJs.
million dollar idea: start a chinese atcoder
Vijos
CodeVS