Problems
 
 
# Name    
A
standard input/output
2 s, 256 MB
Submit  x46
B
standard input/output
2 s, 256 MB
Submit  x24
C
standard input/output
2 s, 256 MB
Submit  x334
D
standard input/output
2 s, 256 MB
Submit  x193
E
standard input/output
2.5 s, 512 MB
Submit  x31
F
standard input/output
0.5 s, 256 MB
Submit  x253
G
standard input/output
1 s, 256 MB
Submit  x141
H
standard input/output
2 s, 256 MB
Submit  x188
I
standard input/output
3 s, 256 MB
Submit  x41
J
standard input/output
2 s, 256 MB
Submit  x13
K
standard input/output
0.25 s, 64 MB
Submit  x292
L
standard input/output
1.5 s, 256 MB
Submit  x20
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2016-08-20 23:35:30
Problem L. The Knapsack problem
*****
Announcement
New tests were added. All solutions will be rejudged. Sorry for the inconvenience.
2016-08-20 21:19:46
Problem I. Protecting the Central Park
*****
Announcement
The limits were missing in the statement. They are 1 <= N <= 10000 and 2 <= M <= 500000. The statement will be fixed shortly.