Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026)
2 days
Register now »
Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026)
2 days
Register now »
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3792 |
| 2 | VivaciousAubergine | 3647 |
| 3 | Kevin114514 | 3603 |
| 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 | 158 |
| 2 | adamant | 152 |
| 3 | Um_nik | 146 |
| 4 | Dominater069 | 144 |
| 5 | errorgorn | 141 |
| 6 | cry | 139 |
| 7 | Proof_by_QED | 136 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
|
0
2^(n-1) could be larger than ans. Its very large for 10^6. The worst case. So possible solution is to take 2^something with loop, taking modulo 10^9+7 in every iteration. |
|
-74
What if someone says that this round is harder than the previous one? Would everyone quit giving it? That depends on us the participants how the round is. And this website is a source of giving us the idea in which topic you lag behind. So lets find and give every round a full shot as if its only created for you. Lets enjoy the process! |
|
0
+1 and +2 symbolises the number of times you attempted the given problem wrong but finally got it correct. As the time increases the penalty increases and is same as the time passed so the person who solves fast will get more points. More information at this link. This is how increase and decrease of rating calculated. |
|
0
The A2OJ website is on renovation. It is in testing mode and hence the website is down. |
