→ Virtual participation
Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.
→ Practice?
Want to solve the contest problems after the official contest ends? Just register for practice and you will be able to submit solutions.
→ Status filter
→ Contest materials
Contest status
| # | When | Who | Problem | Lang | Verdict | Time | Memory |
|---|---|---|---|---|---|---|---|
| 21391112 | Oct/12/2016 22:55 | Rayhan_ahmed | H - Highways | GNU C++11 | Time limit exceeded on test 1 | 500 ms | 5900 KB |
| 21391080 | Oct/12/2016 22:53 | Rayhan_ahmed | H - Highways | GNU C++11 | Time limit exceeded on test 1 | 500 ms | 2000 KB |
| 21228556 | Oct/06/2016 10:29 | Magic | G - Greatest Common Increasing Subsequence | GNU C++11 | Wrong answer on test 1 | 15 ms | 1000 KB |
| 21228541 | Oct/06/2016 10:28 | Magic | G - Greatest Common Increasing Subsequence | GNU C++11 | Wrong answer on test 1 | 31 ms | 1000 KB |
| 21228485 | Oct/06/2016 10:26 | Magic | G - Greatest Common Increasing Subsequence | C++14 (GCC 6-32) | Wrong answer on test 1 | 15 ms | 1000 KB |
| 21228476 | Oct/06/2016 10:25 | Magic | G - Greatest Common Increasing Subsequence | GNU C++11 | Wrong answer on test 1 | 15 ms | 1000 KB |
| 21228412 | Oct/06/2016 10:22 | Magic | G - Greatest Common Increasing Subsequence | GNU C++11 | Wrong answer on test 1 | 15 ms | 3000 KB |
| 21121433 | Oct/02/2016 20:32 | The Unlooked-for: MahmoudSayed, Noureldin, MohamedZain# | F - Factoring a Polynomial | GNU C++11 | Accepted | 15 ms | 200 KB |
| 21121415 | Oct/02/2016 20:30 | The Unlooked-for: MahmoudSayed, Noureldin, MohamedZain# | F - Factoring a Polynomial | GNU C++11 | Wrong answer on test 3 | 15 ms | 200 KB |
| 21121086 | Oct/02/2016 20:15 | The Unlooked-for: MahmoudSayed, Noureldin, MohamedZain# | F - Factoring a Polynomial | GNU C++11 | Wrong answer on test 50 | 31 ms | 200 KB |
| 21121001 | Oct/02/2016 20:11 | The Unlooked-for: MahmoudSayed, Noureldin, MohamedZain# | F - Factoring a Polynomial | GNU C++11 | Wrong answer on test 56 | 31 ms | 200 KB |
| 21120893 | Oct/02/2016 20:06 | The Unlooked-for: MahmoudSayed, Noureldin, MohamedZain# | F - Factoring a Polynomial | GNU C++11 | Wrong answer on test 6 | 15 ms | 200 KB |
| 21119127 | Oct/02/2016 18:49 | _0w0_ | A - Artinals | GNU C++11 | Accepted | 171 ms | 13400 KB |
| 21118920 | Oct/02/2016 18:37 | _0w0_ | A - Artinals | GNU C++11 | Wrong answer on test 1 | 0 ms | 800 KB |
| 21118509 | Oct/02/2016 18:16 | _0w0_ | A - Artinals | GNU C++11 | Time limit exceeded on test 33 | 2000 ms | 7500 KB |
| 21118194 | Oct/02/2016 18:02 | _0w0_ | A - Artinals | GNU C++11 | Wrong answer on test 16 | 483 ms | 5300 KB |
| 21117937 | Oct/02/2016 17:50 | _0w0_ | A - Artinals | GNU C++11 | Wrong answer on test 1 | 0 ms | 1000 KB |
| 21117296 | Oct/02/2016 17:23 | _0w0_ | A - Artinals | GNU C++11 | Memory limit exceeded on test 12 | 483 ms | 65500 KB |
| 21117235 | Oct/02/2016 17:20 | _0w0_ | A - Artinals | GNU C++11 | Memory limit exceeded on test 12 | 483 ms | 65500 KB |
| 21116676 | Oct/02/2016 16:58 | _0w0_ | A - Artinals | GNU C++11 | Wrong answer on test 7 | 295 ms | 1100 KB |
| 21116624 | Oct/02/2016 16:56 | _0w0_ | A - Artinals | GNU C++11 | Runtime error on test 2 | 0 ms | 1000 KB |
| 20987505 | Sep/29/2016 12:16 | Green_Hand | G - Greatest Common Increasing Subsequence | GNU C++11 | Accepted | 15 ms | 1200 KB |
| 20987487 | Sep/29/2016 12:15 | Green_Hand | G - Greatest Common Increasing Subsequence | GNU C++11 | Time limit exceeded on test 1 | 1000 ms | 1000 KB |
| 20987476 | Sep/29/2016 12:14 | Green_Hand | G - Greatest Common Increasing Subsequence | GNU C++11 | Memory limit exceeded on test 1 | 15 ms | 65500 KB |
| 20987469 | Sep/29/2016 12:14 | Green_Hand | G - Greatest Common Increasing Subsequence | GNU C++11 | Memory limit exceeded on test 1 | 265 ms | 65500 KB |
| 20985643 | Sep/29/2016 10:31 | Green_Hand | G - Greatest Common Increasing Subsequence | GNU C++11 | Wrong answer on test 11 | 15 ms | 300 KB |
| 20985505 | Sep/29/2016 10:23 | Green_Hand | G - Greatest Common Increasing Subsequence | GNU C++11 | Wrong answer on test 11 | 15 ms | 300 KB |
| 20985445 | Sep/29/2016 10:20 | Green_Hand | G - Greatest Common Increasing Subsequence | GNU C++11 | Time limit exceeded on test 1 | 1000 ms | 100 KB |
| 20985402 | Sep/29/2016 10:17 | Green_Hand | G - Greatest Common Increasing Subsequence | GNU C++11 | Time limit exceeded on test 1 | 1000 ms | 1900 KB |
| 20799724 | Sep/21/2016 18:41 | Badry | G - Greatest Common Increasing Subsequence | GNU C++11 | Accepted | 31 ms | 1200 KB |
| 20799566 | Sep/21/2016 18:35 | Badry | G - Greatest Common Increasing Subsequence | GNU C++11 | Accepted | 31 ms | 1300 KB |
| 20012957 | Aug/20/2016 23:36 | pitfall | E - Experiment "X": Explosions Expected | Java 8 | Accepted | 577 ms | 26100 KB |
| 20012832 | Aug/20/2016 23:30 | pitfall | E - Experiment "X": Explosions Expected | Java 8 | Time limit exceeded on test 15 | 1000 ms | 61700 KB |
| 20012665 | Aug/20/2016 23:23 | pitfall | E - Experiment "X": Explosions Expected | Java 8 | Time limit exceeded on test 11 | 1000 ms | 41900 KB |
| 20012518 | Aug/20/2016 23:16 | pitfall | E - Experiment "X": Explosions Expected | Java 8 | Wrong answer on test 5 | 109 ms | 26000 KB |
| 20009420 | Aug/20/2016 21:19 | pitfall | K - Key Insertion | Java 8 | Accepted | 343 ms | 47200 KB |
| 20005631 | Aug/20/2016 19:36 | Petruchcho | F - Factoring a Polynomial | Java 8 | Accepted | 93 ms | 25400 KB |
| 20005254 | Aug/20/2016 18:40 | Petruchcho | C - Crankshaft | Java 8 | Accepted | 139 ms | 25500 KB |
| 20003682 | Aug/20/2016 17:57 | pitfall | B - Banal Tickets | Java 8 | Accepted | 592 ms | 31400 KB |
| 19982115 | Aug/20/2016 15:52 | Samara SAU : Haters: Petruchcho, pitfall# | C - Crankshaft | Java 8 | Wrong answer on test 12 | 93 ms | 25400 KB |
| 19982070 | Aug/20/2016 15:49 | Samara SAU : Haters: Petruchcho, pitfall# | C - Crankshaft | Java 8 | Wrong answer on test 12 | 93 ms | 25400 KB |
| 19982059 | Aug/20/2016 15:48 | Samara SAU : Haters: Petruchcho, pitfall# | C - Crankshaft | Java 8 | Runtime error on test 12 | 77 ms | 25400 KB |
| 19981999 | Aug/20/2016 15:43 | Samara SAU : Haters: Petruchcho, pitfall# | B - Banal Tickets | Java 8 | Memory limit exceeded on test 22 | 468 ms | 83000 KB |
| 19981198 | Aug/20/2016 14:51 | Samara SAU : Haters: Petruchcho, pitfall# | B - Banal Tickets | Java 8 | Time limit exceeded on test 41 | 1000 ms | 25400 KB |
| 19981042 | Aug/20/2016 14:41 | Samara SAU : Haters: Petruchcho, pitfall# | B - Banal Tickets | Java 8 | Time limit exceeded on test 41 | 1000 ms | 27200 KB |
| 19980592 | Aug/20/2016 14:17 | Samara SAU : Haters: Petruchcho, pitfall# | F - Factoring a Polynomial | Java 8 | Wrong answer on test 8 | 93 ms | 25400 KB |
| 19980447 | Aug/20/2016 14:05 | Samara SAU : Haters: Petruchcho, pitfall# | F - Factoring a Polynomial | Java 8 | Wrong answer on test 2 | 77 ms | 25400 KB |
| 19980069 | Aug/20/2016 13:38 | Samara SAU : Haters: Petruchcho, pitfall# | C - Crankshaft | Java 8 | Wrong answer on test 6 | 93 ms | 25400 KB |
| 19979095 | Aug/20/2016 12:38 | Samara SAU : Haters: Petruchcho, pitfall# | C - Crankshaft | Java 8 | Wrong answer on test 3 | 93 ms | 25400 KB |
| 19979000 | Aug/20/2016 12:32 | Samara SAU : Haters: Petruchcho, pitfall# | G - Greatest Common Increasing Subsequence | Java 8 | Accepted | 186 ms | 25900 KB |
Sort by:
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/13/2026 23:31:22 (g2).
Desktop version, switch to mobile version.
Supported by
