|
5920 |
codeforces#P734F Anton and School
|
0 / 0 |
9 |
|
5895 |
codeforces#P743B Chloe and the sequence
|
0 / 0 |
4 |
|
5892 |
codeforces#P743E Vladik and cards
|
0 / 0 |
8 |
|
5890 |
codeforces#P744B Hongcow's Game
|
0 / 0 |
6 |
|
5889 |
codeforces#P744C Hongcow Buys a Deck of Cards
|
0 / 0 |
9 |
|
5854 |
codeforces#P750G New Year and Binary Tree Paths
|
0 / 0 |
10 |
|
5845 |
codeforces#P754E Dasha and cyclic table
|
0 / 0 |
10 |
|
5839 |
codeforces#P755F PolandBall and Gifts
|
0 / 0 |
10 |
|
5828 |
codeforces#P757D Felicity's Big Secret Revealed
|
0 / 0 |
8 |
|
5786 |
codeforces#P766E Mahmoud and a xor trip
|
0 / 0 |
7 |
|
5776 |
codeforces#P768E Game of Stones
|
0 / 0 |
7 |
|
5770 |
codeforces#P769D k-Interesting Pairs Of Integers
|
0 / 0 |
5 |
|
5756 |
codeforces#P772D Varying Kibibits
|
0 / 0 |
10 |
|
5729 |
codeforces#P776G Sherlock and the Encrypted Data
|
0 / 0 |
10 |
|
5722 |
codeforces#P778B Bitwise Formula
|
0 / 0 |
6 |
|
5710 |
codeforces#P780F Axel and Marston in Bitland
|
0 / 0 |
9 |
|
5677 |
codeforces#P792D Paths in a Complete Binary Tree
|
0 / 0 |
6 |
|
5655 |
codeforces#P796F Sequence Recovery
|
0 / 0 |
10 |
|
5614 |
codeforces#P803F Coprime Subsequences
|
0 / 0 |
7 |
|
5582 |
codeforces#P812B Sagheer, the Hausmeister
|
0 / 0 |
5 |
|
5556 |
codeforces#P817E Choosing The Commander
|
0 / 0 |
7 |
|
5446 |
codeforces#P845F Guards In The Storehouse
|
0 / 0 |
9 |
|
5416 |
codeforces#P850C Arpa and a game with Mojtaba
|
0 / 0 |
8 |
|
5414 |
codeforces#P850E Random Elections
|
0 / 0 |
10 |
|
5390 |
codeforces#P855E Salazar Slytherin's Locket
|
0 / 0 |
8 |
|
5331 |
codeforces#P865E Hex Dyslexia
|
0 / 0 |
10 |
|
5330 |
codeforces#P865F Egg Roulette
|
0 / 0 |
10 |
|
5325 |
codeforces#P868C Qualification Rounds
|
0 / 0 |
5 |
|
5324 |
codeforces#P868D Huge Strings
|
0 / 0 |
8 |
|
5299 |
codeforces#P875D High Cry
|
0 / 0 |
8 |
|
5290 |
codeforces#P877E Danil and a Part-time Job
|
0 / 0 |
7 |
|
5288 |
codeforces#P878A Short Program
|
0 / 0 |
5 |
|
5285 |
codeforces#P878D Magic Breeding
|
0 / 0 |
10 |
|
5246 |
codeforces#P888E Maximum Subsequence
|
0 / 0 |
6 |
|
5244 |
codeforces#P888G Xor-MST
|
0 / 0 |
8 |
|
5222 |
codeforces#P895C Square Subsets
|
0 / 0 |
7 |
|
5197 |
codeforces#P900D Unusual Sequences
|
0 / 0 |
7 |
|
5183 |
codeforces#P903F Clear The Matrix
|
0 / 0 |
8 |
|
5179 |
codeforces#P906C Party
|
0 / 0 |
9 |
|
5170 |
codeforces#P908E New Year and Entity Enumeration
|
0 / 0 |
9 |
|
5149 |
codeforces#P912B New Year's Eve
|
0 / 0 |
4 |
|
5122 |
codeforces#P913C Party Lemonade
|
0 / 0 |
5 |
|
5120 |
codeforces#P913E Logical Expression
|
0 / 0 |
9 |
|
5112 |
codeforces#P914E Palindromes in a Tree
|
0 / 0 |
9 |
|
5111 |
codeforces#P914F Substrings in a String
|
0 / 0 |
10 |
|
5110 |
codeforces#P914G Sum the Fibonacci
|
0 / 0 |
10 |
|
5100 |
codeforces#P916B Jamie and Binary Sequence (changed after round)
|
0 / 0 |
7 |
|
5077 |
codeforces#P920G List Of Integers
|
0 / 0 |
8 |
|
4977 |
codeforces#P938F Erasing Substrings
|
0 / 0 |
10 |
|
4976 |
codeforces#P938G Shortest Path Queries
|
0 / 0 |
10 |
|
4904 |
codeforces#P959E Mahmoud and Ehab and the xor-MST
|
0 / 0 |
6 |
|
4903 |
codeforces#P959F Mahmoud and Ehab and yet another xor task
|
0 / 0 |
9 |
|
4900 |
codeforces#P960C Subsequence Counting
|
0 / 0 |
5 |
|
4892 |
codeforces#P961C Chessboard
|
0 / 0 |
4 |
|
4839 |
codeforces#P979D Kuro and GCD and XOR and SUM
|
0 / 0 |
8 |
|
4828 |
codeforces#P981D Bookshelves
|
0 / 0 |
6 |
|
4827 |
codeforces#P981E Addition on Segments
|
0 / 0 |
8 |
|
4801 |
codeforces#P986C AND Graph
|
0 / 0 |
9 |
|
4764 |
codeforces#P993B Open Communication
|
0 / 0 |
6 |
|
4763 |
codeforces#P993C Careful Maneuvering
|
0 / 0 |
7 |
|
4694 |
codeforces#P1004F Sonya and Bitwise OR
|
0 / 0 |
10 |
|
4681 |
codeforces#P1006F Xor-Paths
|
0 / 0 |
7 |
|
4679 |
codeforces#P1007B Pave the Parallelepiped
|
0 / 0 |
9 |
|
4667 |
codeforces#P1009G Allowed Letters
|
0 / 0 |
9 |
|
4637 |
codeforces#P1016G Appropriate Team
|
0 / 0 |
10 |
|
4633 |
codeforces#P1017D The Wu
|
0 / 0 |
6 |
|
4601 |
codeforces#P1027G X-mouse in the Campus
|
0 / 0 |
10 |
|
4582 |
codeforces#P1030E Vasya and Good Sequences
|
0 / 0 |
7 |
|
4561 |
codeforces#P1033F Boolean Computer
|
0 / 0 |
10 |
|
4555 |
codeforces#P1034E Little C Loves 3 III
|
0 / 0 |
10 |
|
4548 |
codeforces#P1036G Sources and Sinks
|
0 / 0 |
10 |
|
4535 |
codeforces#P1038E Maximum Matching
|
0 / 0 |
9 |
|
4519 |
codeforces#P1042B Vitamins
|
0 / 0 |
4 |
|
4509 |
codeforces#P1043F Make It One
|
0 / 0 |
9 |
|
4483 |
codeforces#P1051D Bicolorings
|
0 / 0 |
5 |
|
4380 |
codeforces#P1073E Segment Sum
|
0 / 0 |
8 |
|
4319 |
codeforces#P1088D Ehab and another another xor problem
|
0 / 0 |
7 |
|
4269 |
codeforces#P1093G Multidimensional Queries
|
0 / 0 |
8 |
|
4266 |
codeforces#P1095C Powers Of Two
|
0 / 0 |
4 |
|
4254 |
codeforces#P1097B Petr and a Combination Lock
|
0 / 0 |
4 |
|
4250 |
codeforces#P1097F Alex and a TV Show
|
0 / 0 |
9 |
|
4248 |
codeforces#P1097H Mateusz and an Infinite Sequence
|
0 / 0 |
10 |
|
4219 |
codeforces#P1102F Elongated Matrix
|
0 / 0 |
7 |
|
4215 |
codeforces#P1103D Professional layer
|
0 / 0 |
10 |
|
4207 |
codeforces#P1105E Helping Hiasat
|
0 / 0 |
8 |
|
4160 |
codeforces#P1114F Please, another Queries on Array?
|
0 / 0 |
9 |
|
4136 |
codeforces#P1117E Decypher the String
|
0 / 0 |
8 |
|
4135 |
codeforces#P1117F Crisp String
|
0 / 0 |
9 |
|
4032 |
codeforces#P1144E Median String
|
0 / 0 |
6 |
|
4027 |
codeforces#P1145C Mystery Circuit
|
0 / 0 |
(None) |
|
4020 |
codeforces#P1146C Tree Diameter
|
0 / 0 |
5 |
|
4018 |
codeforces#P1146E Hot is Cold
|
0 / 0 |
9 |
|
4003 |
codeforces#P1148F Foo Fighters
|
0 / 0 |
10 |
|
3992 |
codeforces#P1151B Dima and a Bad XOR
|
0 / 0 |
5 |
|
3986 |
codeforces#P1152B Neko Performs Cat Furrier Transform
|
0 / 0 |
4 |
|
3982 |
codeforces#P1152F1 Neko Rules the Catniverse (Small Version)
|
0 / 0 |
10 |
|
3981 |
codeforces#P1152F2 Neko Rules the Catniverse (Large Version)
|
0 / 0 |
10 |
|
3929 |
codeforces#P1163E Magical Permutation
|
0 / 0 |
9 |
|
3916 |
codeforces#P1166E The LCMs Must be Large
|
0 / 0 |
7 |
|
3905 |
codeforces#P1168C And Reachability
|
0 / 0 |
8 |