Problems
 
 
# Name    
A
A1
ladder.in / ladder.out
2 s, 256 MB
Submit  x837
B
B1
lepus.in / lepus.out
2 s, 256 MB
Submit  x544
C
C1
knight.in / knight.out
2 s, 256 MB
Submit  x582
D
D1
king2.in / king2.out
1 s, 64 MB
Submit  x523
E
E1
standard input/output
2 s, 256 MB
Submit  x372
F
F1
standard input/output
2 s, 256 MB
Submit  x211
G
G1
longpath.in / longpath.out
2 s, 256 MB
Submit  x176
H
H1
peacefulsets.in / peacefulsets.out
2 s, 256 MB
Submit  x80
I
I1
standard input/output
1 s, 64 MB
Submit  x281
J
J1
standard input/output
2 s, 256 MB
Submit  x293
K
K1
joseph.in / joseph.out
2 s, 256 MB
Submit  x148
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