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 |
---|---|---|---|---|---|---|
1970 | Helvetic Coding Contest 2024 online mirror (teams allowed, unrated) | FINISHED | False | 16200 | 22373663 | May 4, 2024, 7:05 a.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
---|---|---|---|---|---|---|
( 698 ) | D1 | Arithmancy (Easy) | PROGRAMMING | brute force constructive algorithms interactive strings | 2100 |
B'Professor Vector is preparing to teach her Arithmancy class. She needs to prepare n distinct magic words for the class. Each magic word is a string consisting of characters X and O. A spell is a string created by concatenating two magic words together. The power of a spell is equal to the number of its different non-empty substrings. For example, the power of the spell XOXO is equal to 7, because it has 7 different substrings: X, O, XO, OX, XOX, OXO and XOXO. Each student will create their own spell by concatenating two magic words. Since the students are not very good at magic yet, they will choose each of the two words independently and uniformly at random from the n words provided by Professor Vector. It is therefore also possible that the two words a student chooses are the same. Each student will then compute the power of their spell, and tell it to Professor Vector. In order to check their work, and of course to impress the students, Professor Vector needs to find out which two magic words and in which order were concatenated by each student. Your program needs to perform the role of Professor Vector: first, create n distinct magic words, and then handle multiple requests where it is given the spell power and needs to determine the indices of the two magic words, in the correct order, that were used to create the corresponding spell. This is an interactive problem. First, your program should read a single integer n ( 1 <= n <= 3 ), the number of magic words to prepare. Then, it should print n magic words it has created, one per line. The magic words must be distinct, each magic word must have at least 1 and at most 30 cdot n characters, and each character must be either X or O. We will denote the i -th magic word you printed as w_i ( 1 <= i <= n ). Then, your program should read a single integer q ( 1 <= q <= 1000 ), the number of students in the class. Then, it should repeat the '... |
Helvetic Coding Contest 2024 Editorial |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
---|---|---|---|---|---|---|---|---|---|---|---|
261336946 | sell_gram_wind | D1 | May 17, 2024, 1:35 p.m. | OK | C++14 (GCC 6-32) | TESTS | 4 | 46 | 0 | 2100 | |
261088537 | granadierfc | D1 | May 15, 2024, 5:39 p.m. | OK | C++14 (GCC 6-32) | TESTS | 4 | 46 | 0 | 2100 | |
261622490 | Aleks5d RabbitPower kova1 | D1 | May 19, 2024, 8:16 a.m. | OK | C++14 (GCC 6-32) | TESTS | 4 | 77 | 0 | 2100 | |
261476891 | luogu_bot1 | D1 | May 18, 2024, 7:08 a.m. | OK | C++14 (GCC 6-32) | TESTS | 4 | 77 | 0 | 2100 | |
260548888 | lesunhan2022 | D1 | May 11, 2024, 2:31 p.m. | OK | C++14 (GCC 6-32) | TESTS | 4 | 77 | 0 | 2100 | |
262136474 | Magikarp4000 | D1 | May 22, 2024, 11:31 a.m. | OK | C++17 (GCC 7-32) | TESTS | 4 | 31 | 0 | 2100 | |
262022363 | oloy | D1 | May 21, 2024, 1:10 p.m. | OK | C++17 (GCC 7-32) | TESTS | 4 | 31 | 0 | 2100 | |
261337118 | MIKEFENG | D1 | May 17, 2024, 1:36 p.m. | OK | C++17 (GCC 7-32) | TESTS | 4 | 31 | 0 | 2100 | |
260925430 | K_queries | D1 | May 14, 2024, 12:27 p.m. | OK | C++17 (GCC 7-32) | TESTS | 4 | 31 | 0 | 2100 | |
260835072 | Guslix | D1 | May 13, 2024, 5:04 p.m. | OK | C++17 (GCC 7-32) | TESTS | 4 | 31 | 0 | 2100 | |
260716342 | mohosinamahera23 | D1 | May 12, 2024, 9:43 p.m. | OK | C++17 (GCC 7-32) | TESTS | 4 | 31 | 0 | 2100 | |
259853494 | 2210080011_yakub | D1 | May 7, 2024, 9:29 a.m. | OK | C++17 (GCC 7-32) | TESTS | 4 | 31 | 0 | 2100 | |
263639974 | Doft.qh | D1 | June 1, 2024, 2:07 p.m. | OK | C++17 (GCC 7-32) | TESTS | 4 | 46 | 0 | 2100 | |
262992444 | pineapple_pizza69 | D1 | May 28, 2024, 10:04 a.m. | OK | C++17 (GCC 7-32) | TESTS | 4 | 46 | 0 | 2100 | |
262908523 | Mk72 | D1 | May 27, 2024, 4:18 p.m. | OK | C++17 (GCC 7-32) | TESTS | 4 | 46 | 0 | 2100 | |
261781766 | Ramo7fsw | D1 | May 20, 2024, 12:54 p.m. | OK | C++20 (GCC 13-64) | TESTS | 4 | 31 | 0 | 2100 | |
259801878 | MaxValgen_ | D1 | May 6, 2024, 8:35 p.m. | OK | C++20 (GCC 13-64) | TESTS | 4 | 31 | 0 | 2100 | |
263077744 | Engineer | D1 | May 29, 2024, 2:22 a.m. | OK | C++20 (GCC 13-64) | TESTS | 4 | 46 | 0 | 2100 | |
261661755 | KrK | D1 | May 19, 2024, 2:02 p.m. | OK | C++20 (GCC 13-64) | TESTS | 4 | 46 | 0 | 2100 | |
261641845 | Mahmoud_Haddad LastDance_NotLastOfMe Geo_Ghaffar | D1 | May 19, 2024, 11:04 a.m. | OK | C++20 (GCC 13-64) | TESTS | 4 | 46 | 0 | 2100 | |
260934288 | Tamora Hagry Gondozu | D1 | May 14, 2024, 1:36 p.m. | OK | C++20 (GCC 13-64) | TESTS | 4 | 46 | 0 | 2100 | |
260470083 | Maskrio | D1 | May 11, 2024, 1:53 a.m. | OK | C++20 (GCC 13-64) | TESTS | 4 | 46 | 0 | 2100 | |
260214236 | shanem_1401 Maskrio | D1 | May 10, 2024, 6:50 a.m. | OK | C++20 (GCC 13-64) | TESTS | 4 | 46 | 0 | 2100 | |
260071730 | maspy | D1 | May 9, 2024, 5:12 a.m. | OK | C++20 (GCC 13-64) | TESTS | 4 | 46 | 0 | 2100 | |
259874410 | free989898 SaltyDonut weirdflexbutok | D1 | May 7, 2024, 12:31 p.m. | OK | C++20 (GCC 13-64) | TESTS | 4 | 46 | 0 | 2100 | |
260069507 | Sanj1234 | D1 | May 9, 2024, 4:38 a.m. | OK | GNU C11 | TESTS | 4 | 77 | 9420800 | 2100 | |
259554711 | kaiboy rainboy | D1 | May 4, 2024, 7:48 p.m. | OK | GNU C11 | TESTS | 4 | 77 | 9420800 | 2100 | |
259539849 | dzhi | D1 | May 4, 2024, 5:13 p.m. | OK | Java 21 | TESTS | 4 | 311 | 921600 | 2100 | |
262353052 | Phoenix_sj | D1 | May 24, 2024, 8:09 a.m. | OK | PyPy 3-64 | TESTS | 4 | 124 | 2764800 | 2100 | |
262790123 | just_average_ok | D1 | May 26, 2024, 6:23 p.m. | OK | PyPy 3-64 | TESTS | 4 | 140 | 1433600 | 2100 | |
260951692 | tu144x | D1 | May 14, 2024, 3:57 p.m. | OK | PyPy 3-64 | TESTS | 4 | 171 | 2150400 | 2100 | |
260526329 | aha66 | D1 | May 11, 2024, 10:41 a.m. | OK | PyPy 3-64 | TESTS | 4 | 171 | 2150400 | 2100 | |
260032525 | _Kee | D1 | May 8, 2024, 5:33 p.m. | OK | PyPy 3-64 | TESTS | 4 | 171 | 2150400 | 2100 | |
259995413 | timiss | D1 | May 8, 2024, 12:10 p.m. | OK | PyPy 3-64 | TESTS | 4 | 186 | 2150400 | 2100 | |
262878256 | kl_2200031074 | D1 | May 27, 2024, 12:19 p.m. | OK | Python 3 | TESTS | 4 | 77 | 0 | 2100 | |
262848627 | 2210080018 | D1 | May 27, 2024, 8:12 a.m. | OK | Python 3 | TESTS | 4 | 77 | 0 | 2100 | |
260225744 | I_need_7.0_IELTS | D1 | May 10, 2024, 8:42 a.m. | OK | Python 3 | TESTS | 4 | 77 | 0 | 2100 | |
260223979 | I_need_7.0_IELTS | D1 | May 10, 2024, 8:27 a.m. | OK | Python 3 | TESTS | 4 | 92 | 0 | 2100 | |
259943393 | BetterThanNobita | D1 | May 8, 2024, 3:21 a.m. | OK | Rust 2021 | TESTS | 4 | 46 | 0 | 2100 | |
259948599 | BetterThanNobita | D1 | May 8, 2024, 4:43 a.m. | OK | Rust 2021 | TESTS | 4 | 234 | 85708800 | 2100 |
Back to search problems