| Codeforces Round 944 (Div. 4) |
|---|
| Finished |
| # | Name | ||
|---|---|---|---|
| A |
standard input/output
1 s, 256 MB
|
|
|
| B |
standard input/output
1 s, 256 MB
|
|
|
| C |
standard input/output
1 s, 256 MB
|
|
|
| D |
standard input/output
2 s, 256 MB
|
|
|
| E |
standard input/output
3 s, 256 MB
|
|
|
| F |
standard input/output
1 s, 256 MB
|
|
|
| G |
standard input/output
2 s, 256 MB
|
|
|
| H |
standard input/output
2 s, 256 MB
|
|
|
| Question | Answer | |
|---|---|---|
|
2024-05-10 18:32:55
|
Announcement |
Problem D. Binary Cut
***** The problem D asks for the number of pieces the original string needs to be cut into, not the number of cuts that need to be made. For instance, if the string doesn't need to be cut, the answer is 1. |
| Name |
|---|


