Problems
 
 
# Name    
A
standard input/output
1 s, 256 MB
Submit  x21536
B
standard input/output
1 s, 256 MB
Submit  x17204
C
standard input/output
1 s, 256 MB
Submit  x9240
D
standard input/output
2 s, 256 MB
Submit  x7229
E
standard input/output
1 s, 256 MB
Submit  x1768
F
standard input/output
3 s, 256 MB
Submit  x1032
G
standard input/output
2 s, 256 MB
Submit  x332
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2022-09-12 18:16:59
Announcement
Problem E. Guess the Cycle Size
*****
Each vertex belongs to the cycle, i.e. the length of the cycle (the number of edges in it) is exactly n. The order of the vertices in the cycle is arbitrary.
2022-09-12 18:07:11
Announcement
Problem C. Jumping on Tiles
*****
In output m is the maximum number of visited tiles (i.e. number of jumps is m-1). In the first test case of the example there 3 jumps, i.e. m=4 visited tiles. Look into the picture for details.