It starts in just over an hour, and will last 25 hours.
Link for registering/competing here.
Good Luck!
→ Обратите внимание
→ Лидеры (рейтинг)
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| Страны | Города | Организации | Всё → |
→ Лидеры (вклад)
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 154 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 146 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 135 |
| 9 | maroonrk | 133 |
| 10 | cry | 130 |
→ Найти пользователя
→ Прямой эфир
Codeforces (c) Copyright 2010-2026 Михаил Мирзаянов
Соревнования по программированию 2.0
Время на сервере: 10.11.2026 15:19:03 (g2).
Десктопная версия, переключиться на мобильную.
При поддержке
Am I right that X points after systests is enough to advance?
X = 100?
Qualification Round 2013 — Contestants with 35 points advance to the next round.
I also searched for this information for some minutes: It's in the head line of the scoreboard.
y for larger input data,the results will be announced after the contests?? <>
Yes
@AvadaKedavra I asked y,not "yes" or "no"
Why don't you say "why" instead of "y"?
How to solve D-Large?
One can prove that you can open all the chests iff you have enough keys of each color (including keys in closed chests) and for each unopened chest you can open by some openings sequence (can be checked by dfs). Now you can open chests one by one greedily preserving this property.
What is the solution to C , 2nd large ?
First reference sequence and Second reference sequence
Backtrack to generate all the palindromes (most of the cases will be pruned quite early, and in total there are only 41551 palindromes whose value is less than 10^100).
What do you mean by backtrack in this case? Is there a property that allows you to generate square palindroms of length n given all square palindroms of length < n?
You can notice the title of the sequence here: "Palindromes whose square is a palindrome; also palindromes whose sum of squares of digits is less than 10". And then you can generate all palindromes by iterating over the first half of the number (25 digits maximum), add a reversed second half, square it and get one asked number.
Also, if A[i]>=B[i], where A is first half of the number, which square is palindrome too, then B's square is also a palindrome. Palindrom generation works almost instantly.
Does anyone know how to get stats data (such as how many coders solve a problem, etc) from GCJ scoreboard? I just want to do some data analysis with GCJ data.
Wait some time until stats will published here. The maintainer of this side provides even ist database data where you can do any analysis you want! Google itself refers to him for finding solutions and doing analysis.
Google actually employs him :)
http://ahmed-aly.com/CodeJamTools/