| Codeforces Round 1051 (Div. 2) |
|---|
| Finished |
| # | Name | ||
|---|---|---|---|
| A |
standard input/output
1 s, 256 MB
|
|
|
| B |
standard input/output
1 s, 256 MB
|
|
|
| C |
standard input/output
2 s, 256 MB
|
|
|
| D1 |
standard input/output
3 s, 512 MB
|
|
|
| D2 |
standard input/output
3 s, 512 MB
|
|
|
| E |
standard input/output
2 s, 512 MB
|
|
|
| F |
standard input/output
4 s, 512 MB
|
|
|
| Question | Answer | |
|---|---|---|
|
2025-09-17 18:13:35
|
Announcement |
Problem E. Make Good
***** Problem E: note that the operations can be applied an arbitrary number of times and in arbitrary order. |
|
2025-09-17 18:07:17
|
Announcement |
Problem C. Max Tree
***** The notes for the second example test case have been corrected. Please refresh the statements. |
| Name |
|---|


