| # | Name | ||
|---|---|---|---|
| A |
standard input/output
1 s, 512 MB
|
|
 x40
|
| B |
standard input/output
1 s, 1024 MB
|
|
x35
|
| C |
standard input/output
1 s, 512 MB
|
|
x6
|
| D |
standard input/output
1.5 s, 1024 MB
|
|
x24
|
| E |
standard input/output
1.5 s, 512 MB
|
|
x20
|
| F |
standard input/output
3 s, 512 MB
|
|
x8
|
| G |
standard input/output
1 s, 256 MB
|
|
x18
|
| H |
standard input/output
3 s, 512 MB
|
|
x1
|
| I |
standard input/output
1 s, 512 MB
|
|
x34
|
| Question | Answer | |
|---|---|---|
|
2025-12-07 04:36:34
|
Announcement |
Problem C. Trees and Flowers (flower)
***** The definition of a tree is a simple undirected connected graph with n vertices and n-1 edges. |
|
2025-12-06 22:06:41
|
Announcement |
Problem F. Root Distance Sum (rootsum)
***** Due to Polygon's restriction that prevents uploading output files, we are unable to compute the exact answers. Therefore, on Codeforces your solution will be compared with the model solution using a accuracy requirement of 2% instead of 1%. |
