→ 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 F - Maximal Number of Divisors
Contest status
| # | When | Who | Problem | Lang | Verdict | Time | Memory |
|---|---|---|---|---|---|---|---|
| 30258923 | Sep/11/2017 07:48 | alexrcoleman | F - Maximal Number of Divisors | Java 8 | Accepted | 1107 ms | 0 KB |
| 93356204 | Sep/20/2020 20:22 | ITMO University: Standard deviation: craborac, cdkrot, budalnik# | F - Maximal Number of Divisors | C++17 (GCC 9-64) | Accepted | 608 ms | 7000 KB |
| 216502488 | Jul/31/2023 00:43 | finalissima | F - Maximal Number of Divisors | C++20 (GCC 11-64) | Accepted | 639 ms | 6900 KB |
Sort by:
Codeforces (c) Copyright 2010-2026 Mike Mirzayanov
The only programming contests Web 2.0 platform
Server time: Sep/27/2026 13:43:02 (g2).
Desktop version, switch to mobile version.
Supported by
