Problems
 
 
# Name    
A
A1
complex.in / complex.out
1 s, 256 MB
Submit  x47
B
B1
lie.in / lie.out
1 s, 256 MB
Submit  x133
C
C1
matrix.in / matrix.out
2 s, 256 MB
Submit  x133
D
D1
packing.in / packing.out
2 s, 256 MB
Submit  x29
E
E1
sausage.in / sausage.out
1 s, 256 MB
Submit  x82
F
F1
stations.in / stations.out
1 s, 256 MB
Submit  x30
H
H1
weakconn.in / weakconn.out
2 s, 256 MB
Submit  x142
I
I1
xor.in / xor.out
1 s, 256 MB
Submit  x40
1 The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer