Problems
 
 
# Name    
A
standard input/output
1 s, 256 MB
Submit  x39151
B
standard input/output
1 s, 256 MB
Submit  x20449
C
standard input/output
2 s, 256 MB
Submit  x8390
D
standard input/output
2 s, 256 MB
Submit  x2514
E
standard input/output
3 s, 256 MB
Submit  x964
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2024-05-26 18:02:31
Announcement
Problem B. Binary Colouring
*****
The condition "There does not exist an index 0≤i≤n−2 such that both a[i]≠0 and a[i+1]≠0" is in this problem equivalent to the condition "For all 0≤i≤n−2, (|a[i]| + |a[i+1]|) ≤ 1", where |x| is the absolute value of x.