Problems
 
 
# Name    
A
a-heap.in / a-heap.out
3 s, 256 MB
Submit  x74
B
coloring.in / coloring.out
1 s, 256 MB
Submit  x5
C
divide-heaps.in / divide-heaps.out
2 s, 256 MB
Submit  x38
D
giveaway.in / giveaway.out
2 s, 256 MB
Submit  
E
karlsson.in / karlsson.out
2 s, 256 MB
Submit  x23
F
many-heaps.in / many-heaps.out
3 s, 256 MB
Submit  x5
G
many-heaps2.in / many-heaps2.out
4 s, 256 MB
Submit  x9
H
smith.in / smith.out
2 s, 256 MB
Submit  
I
terminator.in / terminator.out
2 s, 256 MB
Submit  x2
J
toral.in / toral.out
5 s, 256 MB
Submit  
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
2012-12-06 12:21:14
Problem J. Шахматы на торе
*****
Announcement
В задаче J "Шахматы на торе" требуется вывести не ОДИН, а ВСЕ возможные ходы.