Problems
 
 
# Name    
A
standard input/output
2 s, 256 MB
Submit  x16387
B
standard input/output
2 s, 256 MB
Submit  x3768
C
standard input/output
2 s, 256 MB
Submit  x3761
D
standard input/output
1 s, 256 MB
Submit  x2075
E
standard input/output
10 s, 256 MB
Submit  x2230
Complete problemset
 
 
 
 
Questions about problems
 
 
  Question Answer
2015-06-12 20:51:30
Announcement
Problem B. ZgukistringZ
*****
In problem B the following value should be maximized. Consider the string k. Choose some non-overlapping substrings of k such that each substring is either equal to b or to c (or to both of them if b = c). Denote number of substrings chosen as x. x should be maximum possible.
2015-06-12 20:25:47
Announcement
Problem B. ZgukistringZ
*****
String k should be obtained as a permutation of characters of string a. In particular, it is allowed to not shuffle characters at all, i. e. it is allowed to have k = a.