→ About Contest
This contest was held as part of the Winter Programming School (ws.kh.ua),which was carried out in Kharkiv on February 14-24, 2014. The author of the contest is Vitaly Nespirtny, contest subject: finding intersection of semiinfinite planes.
→ 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
Problem L - Reverse beans gathering
Contest status
| # | When | Who | Problem | Lang | Verdict | Time | Memory |
|---|---|---|---|---|---|---|---|
| 8469804 | Oct/29/2014 16:42 | Volgograd STU #1: OnTheRun: Zool, NSV# | L - Reverse beans gathering | GNU C++ | Accepted | 124 ms | 7800 KB |
| 72161136 | Mar/01/2020 15:00 | TWO OLDS: Riladavin, OnlyDeniko# | L - Reverse beans gathering | C++17 (GCC 7-32) | Accepted | 716 ms | 35500 KB |
| 96041573 | Oct/20/2020 09:31 | moonshine | L - Reverse beans gathering | C++17 (GCC 7-32) | Accepted | 62 ms | 400 KB |
| 133242749 | Oct/27/2021 14:29 | Raise ML: vladl2802, TonicJoker, efimov04# | L - Reverse beans gathering | C++17 (GCC 7-32) | Accepted | 996 ms | 1200 KB |
| 8368129 | Oct/23/2014 17:41 | savinov# | L - Reverse beans gathering | GNU C++0x | Accepted | 372 ms | 27300 KB |
Sort by:
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Oct/13/2026 19:13:41 (g2).
Desktop version, switch to mobile version.
Supported by
