Problems
 
 
# Name    
A
ackerman.in / ackerman.out
1 s, 64 MB
Submit  x37
B
angle.in / angle.out
1 s, 64 MB
Submit  x66
C
code.in / code.out
1 s, 64 MB
Submit  x135
D
digit.in / digit.out
1 s, 64 MB
Submit  x103
E
grlex.in / grlex.out
1 s, 64 MB
Submit  x52
F
GSM1
gsm.in / gsm.out
1 s, 64 MB
Submit  x28
G
keeper.in / keeper.out
1 s, 64 MB
Submit  x64
H
left.in / left.out
1 s, 64 MB
Submit  x79
I
railsort.in / railsort.out
1 s, 64 MB
Submit  x132
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