| Code Rush 2025 |
|---|
| Finished |
| # | Name | ||
|---|---|---|---|
| A |
standard input/output
2 s, 256 MB
|
|
|
| B |
standard input/output
1 s, 256 MB
|
|
|
| C |
standard input/output
1 s, 256 MB
|
|
|
| D |
standard input/output
1 s, 256 MB
|
|
|
| E |
standard input/output
9.5 s, 256 MB
|
|
|
| F |
standard input/output
1 s, 256 MB
|
|
|
| G |
standard input/output
1 s, 256 MB
|
|
|
| H |
standard input/output
1 s, 256 MB
|
|
|
| I |
standard input/output
1 s, 256 MB
|
|
|
| J |
standard input/output
1 s, 256 MB
|
|
|
| K |
standard input/output
1 s, 256 MB
|
|
|
| L |
standard input/output
0.9 s, 256 MB
|
|
|
| M |
standard input/output
1 s, 256 MB
|
|
|
| N |
standard input/output
1 s, 256 MB
|
|
|
| O |
standard input/output
1 s, 256 MB
|
|
|
| Question | Answer | |
|---|---|---|
|
2025-04-06 02:04:54
|
Announcement |
Problem O. Obfuscation technique
***** CODE:RUSH:TEC |
|
2025-04-06 01:28:58
|
Announcement |
Problem H. Hiding the One Piece
***** There is a problem with the statement of the problem. One should print values a_i |
|
2025-04-06 01:23:10
|
Announcement |
Problem C. Chess in 3D
***** Problem c will be revaluated |
|
2025-04-06 01:21:53
|
Announcement |
Problem L. Los Ratones
***** German wants to watch a contiguos sequence of matches such that the conditions apply |
|
2025-04-06 01:07:32
|
Announcement |
Problem H. Hiding the One Piece
***** We wil revaluate problem H |
|
2025-04-05 21:53:49
|
Announcement |
Problem I. Integer dyslexia
***** Problem I will be revaluated |
| Name |
|---|


