Problems
 
 
# Name    
A
standard input/output
1 s, 256 MB
Submit  x7903
B
standard input/output
1 s, 256 MB
Submit  x7923
C
standard input/output
1 s, 256 MB
Submit  x12592
D
standard input/output
3 s, 256 MB
Submit  x2346
E
standard input/output
1 s, 256 MB
Submit  x760
F
standard input/output
3 s, 256 MB
Submit  x74
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2018-12-10 20:08:15
Announcement
Problem D. The Fair Nut and the Best Path
*****
A path can consist of one vertex. That is, you can choose any u and v (even u = v).
2018-12-10 19:44:44
Announcement
Problem D. The Fair Nut and the Best Path
*****
u != v, the graph is a correct tree. A path can consist of only one vertex.
2018-12-10 19:43:50
Announcement
Problem A. The Fair Nut and Elevator
*****
The correct constraints on a_i are 0<=a_i<=100 (the examples illustrate the case then a_i=0).