| # | Name | ||
|---|---|---|---|
| A |
standard input/output
2 s, 256 MB
|
|
|
| B |
standard input/output
1 s, 256 MB
|
|
|
| C |
standard input/output
0.8 s, 256 MB
|
|
|
| D |
standard input/output
1 s, 256 MB
|
|
|
| E |
standard input/output
1 s, 256 MB
|
|
|
| F |
standard input/output
1 s, 256 MB
|
|
|
| H |
standard input/output
1 s, 256 MB
|
|
|
| I |
standard input/output
2 s, 256 MB
|
|
|
| J |
standard input/output
1 s, 256 MB
|
|
|
| K |
standard input/output
1 s, 256 MB
|
|
|
| L |
standard input/output
0.5 s, 256 MB
|
|
|
| M |
standard input/output
5 s, 256 MB
|
|
| Question | Answer | |
|---|---|---|
|
2025-08-07 03:52:13
|
Problem M is taken from SEERC 2023 105465I - Impossible Numbers
|
|
|
2025-07-28 05:34:19
|
Problem hidden7268E9CE23D043cvVmoPYSQ6. Agar 1D ***** Dear, At (1,2) Knowing So, (1, index (1, t (1, index (10, then (10, The I Could |
|
|
2025-07-26 22:00:01
|
Problem have been rejudged.
|
|
|
2025-07-26 21:46:48
|
We have updated the statement of problem D, it seems that the statement was not in its latest version, the changes are: - it's guaranteed that there are not three colinear points - the coordinates are up to 4*10^5
|
|
|
2025-07-26 18:30:57
|
El enunciado del problema J ha cambiado. (son 5! permutaciones en lugar de 5)
|
| Name |
|---|


