|
25077 |
codeforces#P2A
Winner
|
12 / 44 |
5 |
|
25086 |
codeforces#P4C
Registration system
|
1 / 3 |
4 |
|
25101 |
codeforces#P7D
Palindrome Degree
|
0 / 2 |
8 |
|
25160 |
codeforces#P19C
Deletion of Repeats
|
0 / 0 |
8 |
|
25189 |
codeforces#P25E
Test
|
0 / 0 |
8 |
|
25203 |
codeforces#P28D
Don't fear, DravDe is kind
|
0 / 0 |
9 |
|
25214 |
codeforces#P30E
Tricky and Clever Password
|
0 / 0 |
10 |
|
25267 |
codeforces#P39J
Spelling Check
|
0 / 0 |
5 |
|
25354 |
codeforces#P54B
Cutting Jigsaw Puzzle
|
0 / 0 |
6 |
|
25415 |
codeforces#P65D
Harry Potter and the Sorting Hat
|
0 / 0 |
8 |
|
25490 |
codeforces#P79C
Beaver
|
0 / 0 |
6 |
|
25501 |
codeforces#P82B
Sets
|
0 / 0 |
5 |
|
25624 |
codeforces#P113B
Petr#
|
0 / 1 |
7 |
|
25650 |
codeforces#P119D
String Transformation
|
0 / 0 |
9 |
|
25682 |
codeforces#P126B
Password
|
2 / 6 |
5 |
|
25689 |
codeforces#P128B
String
|
0 / 0 |
7 |
|
25801 |
codeforces#P154C
Double Profiles
|
0 / 0 |
8 |
|
25947 |
codeforces#P182D
Common Divisors
|
0 / 0 |
4 |
|
25980 |
codeforces#P190E
Counter Attack
|
0 / 0 |
7 |
|
26003 |
codeforces#P196D
The Next Good String
|
0 / 0 |
10 |
|
26068 |
codeforces#P212B
Polycarpus is Looking for Good Substrings
|
0 / 0 |
8 |
|
26076 |
codeforces#P213E
Two Permutations
|
0 / 0 |
10 |
|
26134 |
codeforces#P228C
Fractal Detector
|
0 / 0 |
7 |
|
26194 |
codeforces#P242C
King's Path
|
0 / 0 |
6 |
|
26212 |
codeforces#P245H
Queries for Number of Palindromes
|
1 / 1 |
6 |
|
26396 |
codeforces#P291E
Tree-String Problem
|
0 / 0 |
7 |
|
26495 |
codeforces#P316G1
Good Substrings
|
0 / 0 |
5 |
|
26509 |
codeforces#P319D
Have You Ever Heard About the Word?
|
0 / 0 |
10 |
|
26634 |
codeforces#P350D
Looking for Owls
|
0 / 0 |
9 |
|
26659 |
codeforces#P356E
Xenia and String Problem
|
0 / 0 |
10 |
|
26873 |
codeforces#P407D
Largest Submatrix 3
|
0 / 0 |
10 |
|
26934 |
codeforces#P425D
Sereja and Squares
|
0 / 0 |
8 |
|
27011 |
codeforces#P444D
DZY Loves Strings
|
1 / 2 |
9 |
|
27044 |
codeforces#P452F
Permutation
|
1 / 1 |
10 |
|
27084 |
codeforces#P463C
Gargari and Bishops
|
0 / 0 |
6 |
|
27102 |
codeforces#P467D
Fedor and Essay
|
0 / 0 |
9 |
|
27178 |
codeforces#P486B
OR in Matrix
|
0 / 0 |
4 |
|
27181 |
codeforces#P486E
LIS of Sequence
|
0 / 0 |
8 |
|
27248 |
codeforces#P504E
Misha and LCP on Tree
|
0 / 0 |
10 |
|
27295 |
codeforces#P514C
Watto and Mechanism
|
0 / 0 |
7 |
|
27336 |
codeforces#P524F
And Yet Another Bracket Sequence
|
0 / 0 |
10 |
|
27337 |
codeforces#P525A
Vitaliy and Pie
|
0 / 0 |
3 |
|
27345 |
codeforces#P526D
Om Nom and Necklace
|
0 / 0 |
8 |
|
27371 |
codeforces#P533E
Correcting Mistakes
|
0 / 0 |
6 |
|
27372 |
codeforces#P533F
Encoding
|
0 / 0 |
9 |
|
27377 |
codeforces#P534E
Berland Local Positioning System
|
0 / 0 |
9 |
|
27378 |
codeforces#P534F
Simplified Nonogram
|
0 / 0 |
9 |
|
27382 |
codeforces#P535D
Tavas and Malekas
|
0 / 0 |
6 |
|
27402 |
codeforces#P542D
Superhero's Job
|
0 / 0 |
10 |
|
27477 |
codeforces#P559B
Equivalent Strings
|
0 / 0 |
5 |