Codeforces Round 1097 (Div. 1, Based on Zhili Cup 2026)
3 days
Register now »
Codeforces Round 1097 (Div. 2, Based on Zhili Cup 2026)
3 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 | Proof_by_QED | 146 |
| 3 | Um_nik | 146 |
| 5 | Dominater069 | 144 |
| 6 | errorgorn | 141 |
| 7 | cry | 139 |
| 8 | YuukiS | 135 |
| 9 | chromate00 | 134 |
| 9 | TheScrasse | 134 |
|
0
I usually use java to solve problems. So I was using Java to solve Problem B today and got TLE. This has never happened to me in codeforces before. Can anyone help me figure out what might causing the problem? Java : Solution(TLE) C++ : Solution(AC) |
|
0
Oww. Thank you. I understand now. |
|
0
Thanks for your help! But the given time limit said 1 sec per test. So in a single test I'm only initializing 1e6 int right? |
|
0
Can anyone explain why this O(n) solution of Problem C was giving me TLE? https://mirror.codeforces.com/contest/1335/submission/76571599 |
|
0
How are we ensuring putting the most frequent character will make the String a palindrome? |
|
0
In C, We are checking for the max used char in k+i and replacing them. Where are we ensuring that the final text will become a palindrome? |
|
0
how come in problem b(div 2) they mentions n>=2 but has input n=1 at test 3? |
