Solutions are presented as using the least memory and the fastest execution time. It also takes the top 10 most recent solutions from each language. If you want to limit to a specific index, click the "Solved" button and go to that problem.
ContestId |
Name |
Phase |
Frozen |
Duration (Seconds) |
Relative Time |
Start Time |
|---|---|---|---|---|---|---|
| 2172 | 2025 ICPC Asia Taichung Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) | FINISHED | False | 18000 | 13147823 | Nov. 16, 2025, 1:50 a.m. |
Solved |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 98 ) | D | Divisor Card Game | PROGRAMMING |
In Taiwan, many mathematics teachers design board and card games to help students grasp difficult mathematical concepts. Recently, a particular card game has gone viral among elementary and middle school teachers because it effectively helps students understand the concepts of divisors and multiples, while also being highly engaging for both teachers and students. The rules of the game are as follows. The teacher prepares (n) distinct cards, labeled from (1) to (n). The (i)-th card has an integer value (a_i) written on it, and the integers (a_1, a_2, \dots, a_n) are in a strictly increasing order. There are (m) students labeled from (1) to (m) participating in the game. Before the game begins, each student receives a nonempty subset of the (n) cards. No two students share any card, and at least one card remains undealt. Let (k) denote the number of undealt cards initially. The game consists of (k) rounds. In each round, the following steps occur in order: The teacher selects one of the remaining undealt cards uniformly at random and reveals it to all students. Let (c) be the integer written on this card. Each student simultaneously chooses exactly one card from their own collection. The ownership of the revealed card is determined as follows: Among the values of all cards chosen by the students, consider those that are divisible by (c). If there are one or more such values, the student who selected a card with the smallest divisible value wins the revealed card and adds it to their collection. If no chosen cards have value divisible by (c), the revealed card is discarded (remains unowned). Discarded cards are not used in subsequent rounds. Among the values of all cards chosen by the students, consider those that are divisible by (c). If there are one or more such values, the student who selected a card with the smallest divisible value wins the revealed card and adds it to their collection. If |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 349219494 | mo_onrabbit2 | D | Nov. 16, 2025, 7:08 a.m. | OK | C++20 (GCC 13-64) | TESTS | 73 | 62 | 102400 | ||
| 349324499 | bachbeo2007 | D | Nov. 16, 2025, 4:35 p.m. | OK | C++20 (GCC 13-64) | TESTS | 73 | 93 | 0 | ||
| 349236089 | feeder1 | D | Nov. 16, 2025, 9:43 a.m. | OK | C++20 (GCC 13-64) | TESTS | 73 | 155 | 3072000 | ||
| 349249984 | BurnedChicken | D | Nov. 16, 2025, 11:31 a.m. | OK | C++20 (GCC 13-64) | TESTS | 73 | 171 | 4403200 | ||
| 349215352 | johnny8337 mo_onrabbit2 as_dfsdf | D | Nov. 16, 2025, 6:30 a.m. | OK | C++20 (GCC 13-64) | TESTS | 73 | 624 | 22937600 | ||
| 349218759 | platter | D | Nov. 16, 2025, 7:01 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 73 | 124 | 5939200 | ||
| 349221702 | hungchi17 | D | Nov. 16, 2025, 7:29 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 73 | 155 | 6451200 | ||
| 349219083 | leinad2 | D | Nov. 16, 2025, 7:04 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 73 | 155 | 6451200 | ||
| 349226829 | qwerasdfzxcl | D | Nov. 16, 2025, 8:18 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 73 | 327 | 8294400 | ||
| 349230707 | namespace_std | D | Nov. 16, 2025, 8:54 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 73 | 405 | 54476800 | ||
| 349256572 | ogenus | D | Nov. 16, 2025, 12:26 p.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 73 | 750 | 23142400 | ||
| 349226334 | ogenus | D | Nov. 16, 2025, 8:13 a.m. | OK | C++23 (GCC 14-64, msys2) | TESTS | 73 | 780 | 23142400 | ||
| 349196535 | sansen | D | Nov. 16, 2025, 2:53 a.m. | OK | Rust 2021 | TESTS | 73 | 62 | 0 |
Back to search problems