Problems
 
 
# Name    
A
standard input/output
4 s, 256 MB
Submit  x54
B
standard input/output
1 s, 256 MB
Submit  x117
C
standard input/output
8 s, 512 MB
Submit  x55
D
standard input/output
2 s, 256 MB
Submit  x35
E
standard input/output
4 s, 256 MB
Submit  x84
F
standard input/output
2 s, 256 MB
Submit  x24
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2015-01-07 19:49:54
Problem E. Palindrome Query
*****
Announcement
If there is no such substring in query type 3, print -1 .
2015-01-07 19:12:00
Problem B. ShortestPath Query
*****
in the second example C is 1 but there is c(u,v) = 2
C should be 2 or more? no?
Yes
2015-01-07 18:50:24
Problem A. LCM Query
*****
Could you explain what is this?

mini = 1n - x + 1 (lcm(ai, ai + 1, ..., ai + x - 1))
It means the minimum value of lcm(a_i,a_{i+1},...,a_{i+x-1}) where 1 <= i <= n-x+1