| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3611 |
| 4 | jiangly | 3583 |
| 5 | strapple | 3515 |
| 6 | tourist | 3470 |
| 7 | dXqwq | 3436 |
| 8 | Radewoosh | 3415 |
| 9 | Otomachi_Una | 3413 |
| 10 | Um_nik | 3376 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 163 |
| 2 | adamant | 149 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 143 |
| 5 | errorgorn | 141 |
| 6 | cry | 138 |
| 7 | Proof_by_QED | 135 |
| 7 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 10 | soullless | 132 |
|
On
george_stelian →
"Adolescent Grigore Moisil" (AGM) International Programming Contest 2025, 14 months ago
+18
The contest is now also available in the gym. |
|
On
george_stelian →
"Adolescent Grigore Moisil" (AGM) International Programming Contest 2023, 3 years ago
+10
Hi! The problems are available for upsolving in the gym |
|
+111
orz |
|
0
orz |
|
+61
McDic orz |
|
+10
numb so rude |
|
+8
Good luck sir! |
|
+25
Thank you sir |
|
+99
We need a stefdasca x tmwilliamlin168 crossover. |
|
0
For each node you can precompute jumps with lengths powers of 2 and answer queries using binary lifting. |
|
+166
|
|
0
Orz |
|
+25
Div 1 orz |
|
+29
Use kmp |
|
+2
This is known as maximum matching in a bipartite graph and can be solved using Hopcroft Karp |
|
+28
Maybe this can help: https://mirror.codeforces.com/blog/entry/47516 |
|
+4
We hang out on the same lake. |
|
+8
Awesome, thanks for sharing |
|
+13
Great! |
|
On
amiable99 →
Why am I getting TLE even though the complexity looks O(n*log(n)) to me?, 7 years ago
+12
I assume it is because your comp breaks the sort. Here is the modified correct version: https://mirror.codeforces.com/contest/1185/submission/55805231 |
|
+3
You should calculate exponent modulo phi(MOD) which is MOD-1 in this case. |
|
+22
It's just a Controlled Not gate. https://en.wikipedia.org/wiki/Controlled_NOT_gate |
|
+22
lol Are you taking quantum computing classes for the Olympiad? |
|
+1
It seems that the round is planned to begin at 12:00 Moscow time, contrary to what we were announced in the last e-mail. "December 16 at 16:00 Moscow time." |
|
0
Only russian statements too. |
|
+55
Author had solution for G, but this tutorial is too small to contain it. |
|
0
There's an appearance issue in C tutorial |
|
+5
English tutorial for E? |
|
0
Expected output? |
|
+10
Hack for D : 5 2 3 5 7 210 Answer : NO |
|
0
What about long long main() ? |
|
0
What the problem meant is: If you replace every character in s with f(s[i]) you should get string t. Meaning that "aab" and "abb" are not isomorphic since running s through your function would create string "bba" and not "abb". |
|
+3
Can someone explain their solution for E? I was thinking about something involving cliques but couldn't figure it out. |
|
0
I finally understand. Thank you so much. |
|
+4
Could anyone explain me the solution to div2 D. I can't seem to understand why this always works. For 4 4 1 2 3 wouldn't the output be 4 1 2 3? |
| Name |
|---|


