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 |
|---|---|---|---|---|---|---|
| 2038 | 2024-2025 ICPC, NERC, Southern and Volga Russian Regional Contest (Unrated, Online Mirror, ICPC Rules, Preferably Teams) | FINISHED | False | 18000 | 44479523 | Nov. 18, 2024, 10:35 a.m. |
Solved |
Index |
Name |
Type |
Tags |
Community Tag |
Rating |
|---|---|---|---|---|---|---|
| ( 11324 ) | N | Fixing the Expression | PROGRAMMING | implementation | 800 |
An expression is a string consisting of three characters, where the first and the last characters are digits (from (0) to (9)), and the middle character is a comparison symbol ( < , = or > ). An expression is true if the comparison symbol matches the digits (for example, if the first digit is strictly less than the last digit, the comparison symbol should be < ). For example, the expressions 1<3 , 4>2 , 0=0 are true, while 5>5 , 7<3 are not. You are given a string (s), which is an expression. Change as few characters as possible so that (s) becomes a true expression. Note that if (s) is already true, you should leave it as it is. The first line contains one integer (t) ((1 \le t \le 300)) — the number of test cases. Each test case consists of one line containing the string (s) ((|s| = 3), the first and the last characters of (s) are digits, the second character is a comparison symbol). For each test case, print a string consisting of (3) characters — a true expression which can be obtained by changing as few characters as possible in (s). If there are multiple answers, print any of them. |
Submission Id |
Author(s) |
Index |
Submitted |
Verdict |
Language |
Test Set |
Tests Passed |
Time taken (ms) |
Memory Consumed (bytes) |
Tags |
Rating |
|---|---|---|---|---|---|---|---|---|---|---|---|
| 292276190 | N_S_N | N | Nov. 19, 2024, 5:11 a.m. | OK | C# 10 | TESTS | 2 | 77 | 0 | 800 | |
| 292168743 | bahrom_02 DMM_0112 | N | Nov. 18, 2024, 11:29 a.m. | OK | C# 10 | TESTS | 2 | 77 | 307200 | 800 | |
| 292158659 | whopassby zrnstnsr __baozii__ | N | Nov. 18, 2024, 10:38 a.m. | OK | C# 10 | TESTS | 2 | 140 | 3788800 | 800 |
Back to search problems