| Codeforces Round 1046 (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
|
|
|
| D |
standard input/output
2 s, 256 MB
|
|
|
| E |
standard input/output
4 s, 512 MB
|
|
|
| F1 |
standard input/output
3 s, 512 MB
|
|
|
| F2 |
standard input/output
3 s, 512 MB
|
|
|
| Question | Answer | |
|---|---|---|
|
2025-08-28 21:13:55
|
Announcement |
Problem F1. From the Unknown (Easy Version)
***** There was a bug in the interactor for today's problems D/F that sometimes accepted incorrectly formatted output. This was only discovered late in the contest, and submissions were rejudged after the contest finished. Five participants were affected, we have contacted them with an option to be removed from the rating recalculation. |
|
2025-08-28 18:54:39
|
Announcement |
Problem F2. From the Unknown (Hard Version)
***** In problem "From the Unknown (Hard Version)", the constraint "sum of the lengths of the articles (i.e., n) over all queries must not exceed 25,000" is within a single test case, not over all test cases. That means, in each test case, you are allowed to make queries with sum n up to 25000. |
| Name |
|---|


