Problems
 
 
# Name    
C
standard input/output
1 s, 256 MB
Submit  x36
D
standard input/output
1 s, 256 MB
Submit  x31
E
standard input/output
1 s, 256 MB
Submit  x20
F
standard input/output
1 s, 256 MB
Submit  x29
G
standard input/output
1 s, 256 MB
Submit  x17
H
standard input/output
1 s, 256 MB
Submit  x10
I
standard input/output
1 s, 256 MB
Submit  x15
J
standard input/output
1 s, 256 MB
Submit  x3
K
standard input/output
3 s, 256 MB
Submit  x6
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2020-10-24 03:25:16
Problem G. Hyper Chocolate Cubes
*****
Announcement
There is a slight misprint in this problem. Assume that there are 101 houses instead of 100, where the 101st house will give w^100 candies. You will have cubes of size 1, w, w^2, ..., w^100.
2020-10-24 02:42:34
Problem E. Spooky Numbers
*****
Announcement
We are currently fixing the misprint that says spooky numbers can only be positive, since 0 is spooky as well. Please use the sample data as a guideline for solving the problem.
2020-10-24 02:38:58
Problem E. Spooky Numbers
*****
The problem statement claims that any positive number divisible by 2, 3, or 5 is spooky. Why is the answer for the first sample case `0` and not `-1`, since zero is not positive?
Sorry, that was a misprint! It should say nonnegative instead of positive.