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 |
---|---|---|---|---|---|---|
1302 | AIM Tech Poorly Prepared Contest (unrated, funny, Div. 1 preferred) | FINISHED | False | 10800 | 151076699 | Feb. 3, 2020, 4:15 p.m. |
Solved$ |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
---|---|---|---|---|---|---|
( 23 ) | G | Keep talking and nobody explodes -- medium | PROGRAMMING |
B"This is an unusual problem in an unusual contest, here is the announcement: http://codeforces.com/blog/entry/73543 You have the safe lock which consists of 5 decimal digits. If you rotate some digit, it increases by one, except 9 which becomes 0. Initially, the lock contains number x . To unlock the safe you must do the following operations in order (and be careful, don't mix up if and else statements). If sum of digits on positions 3 and 4 is greater than 10, rotate digit on position 2 by 9 times, else rotate digit on position 5 by 4 times. If digit on position 3 is greater than digit on position 5, rotate digit on position 2 by 4 times, else rotate digit on position 4 by 6 times. If digit on position 5 is greater than digit on position 3, rotate digit on position 2 by 1 times, else rotate digit on position 1 by 7 times. If sum of digits on positions 4 and 1 is greater than 8, rotate digit on position 2 by 7 times, else rotate digit on position 3 by 3 times. If digit on position 4 is greater than digit on position 1, rotate digit on position 2 by 3 times, else rotate digit on position 3 by 2 times. If sum of digits on positions 1 and 2 is greater than 9, rotate digit on position 3 by 6 times, else rotate digit on position 5 by 3 times. If digit on position 3 is greater than digit on position 2, rotate digit on position 1 by 2 times, else rotate digit on position 4 by 5 times. If digit on position 5 is greater than digit on position 3, rotate digit on position 2 by 1 times, else rotate digit on position 4 by 5 times. If sum of digits on positions 5 and 1 is greater than 10, rotate digit on position 4 by 7 times, else rotate digit on position 3 by 5 times. If sum of digits on positions 5 and 4 is greater than 9, rotate digit on position 3 by 9 times, else rotate digit on position 2 by 4 times. If sum of digits on positions 3 and 1 is greater than 8, rotate digit on position 2 by 8 times, else rotate digit on position 4 by 4 times. If digit on position "... |
73599 |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
---|---|---|---|---|---|---|---|---|---|---|---|
70175342 | Jatana cookiedoth Egor.Lifar | G | Feb. 3, 2020, 6:22 p.m. | OK | GNU C++11 | TESTS | 20 | 31 | 0 | ||
70178375 | 300iq Kamfucius orz | G | Feb. 3, 2020, 7:12 p.m. | OK | GNU C++11 | TESTS | 20 | 31 | 60108800 | ||
70478300 | khulegu | G | Feb. 7, 2020, 4:55 a.m. | OK | GNU C++14 | TESTS | 20 | 30 | 0 | ||
70174609 | Diorvh CN_zwang2002 cyy233cnbb | G | Feb. 3, 2020, 6:11 p.m. | OK | GNU C++17 | TESTS | 20 | 30 | 0 | ||
70177746 | voidmax manoprenko isaf27 | G | Feb. 3, 2020, 7:01 p.m. | OK | GNU C++17 | TESTS | 20 | 30 | 204800 | ||
70178308 | mango_lassi | G | Feb. 3, 2020, 7:11 p.m. | OK | GNU C++17 | TESTS | 20 | 30 | 2457600 | ||
70181430 | Radewoosh | G | Feb. 3, 2020, 8:21 p.m. | OK | GNU C++17 | TESTS | 20 | 30 | 20070400 | ||
70180432 | AndreySergunin | G | Feb. 3, 2020, 7:56 p.m. | OK | GNU C++17 | TESTS | 20 | 31 | 204800 | ||
70177393 | Andreikkaa SendThemToHell ch_egor | G | Feb. 3, 2020, 6:55 p.m. | OK | GNU C++17 | TESTS | 20 | 31 | 204800 | ||
70175056 | eatmore | G | Feb. 3, 2020, 6:17 p.m. | OK | Java 11 | TESTS | 20 | 186 | 0 |
Back to search problems