| # | When | Who | Problem | Lang | Verdict | Time | Memory |
|---|---|---|---|---|---|---|---|
| 362595546 | Feb/12/2026 11:33 | findingnewo | F - Double Bracket Sequence | C++20 (GCC 13-64) | Accepted | 46 ms | 100 KB |
| 362595049 | Feb/12/2026 11:28 | findingnewo | F - Double Bracket Sequence | C++20 (GCC 13-64) | Wrong answer on test 2 | 31 ms | 0 KB |
| 362503831 | Feb/11/2026 19:43 | findingnewo | F - Double Bracket Sequence | C++20 (GCC 13-64) | Wrong answer on pretest 2 | 31 ms | 0 KB |
| 362492815 | Feb/11/2026 19:21 | findingnewo | D - Another Problem about Beautiful Pairs | C++20 (GCC 13-64) | Accepted | 187 ms | 100 KB |
| 362489689 | Feb/11/2026 19:16 | findingnewo | D - Another Problem about Beautiful Pairs | C++20 (GCC 13-64) | Wrong answer on pretest 1 | 31 ms | 0 KB |
| 362472377 | Feb/11/2026 18:46 | findingnewo | E1 - Interactive Graph (Simple Version) | C++20 (GCC 13-64) | Accepted | 46 ms | 100 KB |
| 362471878 | Feb/11/2026 18:46 | findingnewo | E2 - Interactive Graph (Hard Version) | C++20 (GCC 13-64) | Accepted | 46 ms | 100 KB |
| 362470249 | Feb/11/2026 18:43 | findingnewo | E2 - Interactive Graph (Hard Version) | C++20 (GCC 13-64) | Wrong answer on pretest 3 | 31 ms | 0 KB |
| 362462295 | Feb/11/2026 18:31 | findingnewo | E2 - Interactive Graph (Hard Version) | C++20 (GCC 13-64) | Idleness limit exceeded on pretest 1 | 0 ms | 0 KB |
| 362420248 | Feb/11/2026 17:44 | findingnewo | C - Game with a Fraction | C++20 (GCC 13-64) | Accepted | 46 ms | 100 KB |
| 362417437 | Feb/11/2026 17:42 | findingnewo | B - Array and Permutation | C++20 (GCC 13-64) | Accepted | 109 ms | 100 KB |
| 362414477 | Feb/11/2026 17:39 | findingnewo | A - Friendly Numbers | C++20 (GCC 13-64) | Accepted | 31 ms | 100 KB |
| 362411105 | Feb/11/2026 17:36 | findingnewo | A - Friendly Numbers | C++20 (GCC 13-64) | Wrong answer on pretest 2 | 31 ms | 0 KB |

| Name |
|---|


