Problems
 
 
# Name    
A
standard input/output
1 s, 256 MB
Submit  x76
B
standard input/output
0.25 s, 256 MB
Submit  x80
C
standard input/output
0.5 s, 256 MB
Submit  x142
D
standard input/output
1 s, 256 MB
Submit  x15
E
standard input/output
1 s, 256 MB
Submit  x86
F
standard input/output
0.5 s, 128 MB
Submit  x127
G
standard input/output
0.5 s, 128 MB
Submit  x61
H
standard input/output
3 s, 256 MB
Submit  x67
I
standard input/output
1 s, 256 MB
Submit  x88
J
standard input/output
3 s, 512 MB
Submit  x14
K
standard input/output
0.8 s, 256 MB
Submit  x50
L
standard input/output
1.5 s, 256 MB
Submit  x65
M
standard input/output
1 s, 256 MB
Submit  x62
N
standard input/output
1 s, 256 MB
Submit  x100
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2022-10-30 15:05:07
Announcement
Problem G. Battle of Scundu
*****
For 30 points, it is guaranteed that N <= 1000 (not 20 points)
2022-10-30 12:39:38
Announcement
Problem E. CntSeq
*****
The substrings with their maximum value between 3 and 4 are: [4],[2,4],[4,3],[2,4,3],[3]
2022-10-30 12:35:15
Problem E. CntSeq
*****
In the explanation of the example, is there a mistake at The substrings with their maximum value between 3 and 4 are: [4],[2,4],[4,3],[4,3,2],[3] ? Should it be [2,4,3] instead of [4,3,2]?
Yes
2022-10-30 12:28:16
Announcement
Problem N. Bitscore
*****
If there are equal values in the vector, they form different subsets. (We consider subsets of positions).

For example if we have the vector 1, 3, 3

(3, 1) formed by positions 2 and 1, and (3, 1) formed by positions 3 and 1 are 2 different subsets
2022-10-30 12:08:57
Announcement
Problem D. Gioconda
*****
Pairwise distinct is for the values of substring