| # | When | Who | Problem | Lang | Verdict | Time | Memory |
|---|---|---|---|---|---|---|---|
| 389823015 | Sep/08/2026 05:39 |
|
H - Human-Readable Number | Unknown | Accepted | 0 ms | 0 KB |
| 389823014 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Runtime error | 0 ms | 0 KB |
| 389823013 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Rejected | 0 ms | 0 KB |
| 389823012 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823011 | Sep/08/2026 05:39 |
|
G - Game of Passing Cards | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823010 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Accepted | 0 ms | 0 KB |
| 389823009 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Rejected | 0 ms | 0 KB |
| 389823008 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823007 | Sep/08/2026 05:39 |
|
G - Game of Passing Cards | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823006 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823005 | Sep/08/2026 05:39 |
|
D - Dynamic Connectivity Across Graphs | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389823004 | Sep/08/2026 05:39 |
|
H - Human-Readable Number | Unknown | Compilation error | 0 ms | 0 KB |
| 389823003 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823002 | Sep/08/2026 05:39 |
|
G - Game of Passing Cards | Unknown | Runtime error | 0 ms | 0 KB |
| 389823001 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Wrong answer | 0 ms | 0 KB |
| 389823000 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822999 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822998 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389822997 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389822996 | Sep/08/2026 05:39 |
|
D - Dynamic Connectivity Across Graphs | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822995 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822994 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822993 | Sep/08/2026 05:39 |
|
J - Jumbled Block Hierarchy | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389822992 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822991 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822990 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Compilation error | 0 ms | 0 KB |
| 389822989 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389822988 | Sep/08/2026 05:39 |
|
K - Keep the Fairness | Unknown | Rejected | 0 ms | 0 KB |
| 389822987 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822986 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822985 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389822984 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822983 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Accepted | 0 ms | 0 KB |
| 389822982 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389822981 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389822980 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389822978 | Sep/08/2026 05:39 |
|
F - First and Second Minimum | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389822977 | Sep/08/2026 05:39 |
|
A - Assigning Distinct Integers | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822976 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389822975 | Sep/08/2026 05:39 |
|
G - Game of Passing Cards | Unknown | Runtime error | 0 ms | 0 KB |
| 389822974 | Sep/08/2026 05:39 |
|
H - Human-Readable Number | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822973 | Sep/08/2026 05:39 |
|
B - Box Projections | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822972 | Sep/08/2026 05:39 |
|
H - Human-Readable Number | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822971 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822970 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822969 | Sep/08/2026 05:39 |
|
G - Game of Passing Cards | Unknown | Time limit exceeded | 0 ms | 0 KB |
| 389822968 | Sep/08/2026 05:39 |
|
E - Encoded Shortest Paths | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822967 | Sep/08/2026 05:39 |
|
H - Human-Readable Number | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822966 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Wrong answer | 0 ms | 0 KB |
| 389822965 | Sep/08/2026 05:39 |
|
C - Constructing Box Projections | Unknown | Wrong answer | 0 ms | 0 KB |

| Name |
|---|


