|
|
4143 |
P1081C Colorful Bricks
|
0 / 0 |
普及
|
|
|
4133 |
P1082E Increasing Frequency
|
0 / 0 |
提高
|
|
|
4132 |
P1082F Speed Dial
|
0 / 0 |
CTSC
|
|
|
4130 |
P1083A The Fair Nut and the Best Path
|
0 / 0 |
普及
|
|
|
4126 |
P1083E The Fair Nut and Rectangles
|
0 / 0 |
NOI
|
|
|
4122 |
P1084C The Fair Nut and String
|
0 / 0 |
普及
|
|
|
4115 |
P1085G Beautiful Matrix
|
0 / 0 |
CTSC
|
|
|
4109 |
P1088E Ehab and a component choosing problem
|
0 / 0 |
NOI
|
|
|
4107 |
P1089A Alice the Fan
|
0 / 0 |
省选
|
|
|
4078 |
P1091D New Year and the Permutation Concatenation
|
0 / 0 |
普及
|
|
|
4067 |
P1092F Tree with Maximum Cost
|
0 / 0 |
普及
|
|
|
4061 |
P1093F Vasya and Array
|
0 / 0 |
NOI
|
|
|
4050 |
P1096D Easy Problem
|
0 / 0 |
普及
|
|
|
4049 |
P1096E The Top Scorer
|
0 / 0 |
NOI
|
|
|
4048 |
P1096F Inversion Expectation
|
0 / 0 |
省选
|
|
|
4047 |
P1096G Lucky Tickets
|
0 / 0 |
NOI
|
|
|
4045 |
P1097B Petr and a Combination Lock
|
0 / 0 |
普及-
|
|
|
4043 |
P1097D Makoto and a Blackboard
|
0 / 0 |
省选
|
|
|
4040 |
P1097G Vladislav and a Great Legend
|
0 / 0 |
CTSC
|
|
|
4039 |
P1097H Mateusz and an Infinite Sequence
|
0 / 0 |
CTSC
|
|
|
4029 |
P1099F Cookies
|
0 / 0 |
NOI
|
|
|
4019 |
P1101D GCD Counting
|
0 / 0 |
提高
|
|
|
4017 |
P1101F Trucks and Cities
|
0 / 0 |
NOI
|
|
|
4010 |
P1102F Elongated Matrix
|
0 / 0 |
提高
|
|
|
4006 |
P1103D Professional layer
|
0 / 0 |
CTSC
|
|
|
4000 |
P1105C Ayoub and Lost Array
|
0 / 0 |
普及
|
|
|
3998 |
P1105E Helping Hiasat
|
0 / 0 |
省选
|
|
|
3993 |
P1106E Lunar New Year and Red Envelopes
|
0 / 0 |
提高
|
|
|
3988 |
P1107D Compression
|
0 / 0 |
普及
|
|
|
3987 |
P1107E Vasya and Binary String
|
0 / 0 |
NOI
|
|
|
3986 |
P1107F Vasya and Endless Credits
|
0 / 0 |
CTSC
|
|
|
3985 |
P1107G Vasya and Maximum Profit
|
0 / 0 |
NOI
|
|
|
3981 |
P1108D Diverse Garland
|
0 / 0 |
普及-
|
|
|
3977 |
P1109A Sasha and a Bit of Relax
|
0 / 0 |
普及
|
|
|
3974 |
P1109D Sasha and Interesting Fact from Graph Theory
|
0 / 0 |
NOI
|
|
|
3968 |
P1110D Jongmah
|
0 / 0 |
省选
|
|
|
3964 |
P1110H Modest Substrings
|
0 / 0 |
CTSC
|
|
|
3960 |
P1111D Destroy the Colony
|
0 / 0 |
CTSC
|
|
|
3959 |
P1111E Tree
|
0 / 0 |
NOI
|
|
|
3958 |
P1113A Sasha and His Trip
|
0 / 0 |
普及-
|
|
|
3953 |
P1114D Flood Fill
|
0 / 0 |
普及
|
|
|
3928 |
P1117D Magic Gems
|
0 / 0 |
提高
|
|
|
3926 |
P1117F Crisp String
|
0 / 0 |
NOI
|
|
|
3917 |
P1118F2 Tree Cutting (Hard Version)
|
0 / 0 |
CTSC
|
|
|
3912 |
P1119E Pavel and Triangles
|
0 / 0 |
普及
|
|
|
3911 |
P1119F Niyaz and Small Degrees
|
0 / 0 |
CTSC
|
|
|
3906 |
P1120C Compress String
|
0 / 0 |
提高
|
|
|
3905 |
P1120D Power Tree
|
0 / 0 |
NOI
|
|
|
3903 |
P1120F Secret Letters
|
0 / 0 |
CTSC
|
|
|
3896 |
P1129C Morse Code
|
0 / 0 |
NOI
|
|
|
3895 |
P1129D Isolation
|
0 / 0 |
CTSC
|
|
|
3887 |
P1131D Gourmet choice
|
0 / 0 |
提高
|
|
|
3886 |
P1131E String Multiplication
|
0 / 0 |
省选
|
|
|
3884 |
P1131G Most Dangerous Shark
|
0 / 0 |
CTSC
|
|
|
3879 |
P1132E Knapsack
|
0 / 0 |
省选
|
|
|
3878 |
P1132F Clear the String
|
0 / 0 |
提高
|
|
|
3877 |
P1132G Greedy Subsequences
|
0 / 0 |
NOI
|
|
|
3872 |
P1133E K Balanced Teams
|
0 / 0 |
普及
|
|
|
3862 |
P1137C Museums Tour
|
0 / 0 |
NOI
|
|
|
3853 |
P1139D Steps to One
|
0 / 0 |
省选
|
|
|
3847 |
P1140D Minimum Triangulation
|
0 / 0 |
普及-
|
|
|
3846 |
P1140E Palindrome-less Arrays
|
0 / 0 |
省选
|
|
|
3834 |
P1142B Lynyrd Skynyrd
|
0 / 0 |
提高
|
|
|
3832 |
P1142D Foreigner
|
0 / 0 |
CTSC
|
|
|
3821 |
P1144G Two Merged Sequences
|
0 / 0 |
NOI
|
|
|
3808 |
P1146F Leaf Partition
|
0 / 0 |
NOI
|
|
|
3807 |
P1146G Zoning Restrictions
|
0 / 0 |
CTSC
|
|
|
3806 |
P1146H Satanic Panic
|
0 / 0 |
CTSC
|
|
|
3790 |
P1149B Three Religions
|
0 / 0 |
省选
|
|
|
3788 |
P1149D Abandoning Roads
|
0 / 0 |
CTSC
|
|
|
3783 |
P1151B Dima and a Bad XOR
|
0 / 0 |
普及
|
|
|
3780 |
P1151E Number of Components
|
0 / 0 |
提高
|
|
|
3779 |
P1151F Sonya and Informatics
|
0 / 0 |
省选
|
|
|
3775 |
P1152D Neko and Aki's Prank
|
0 / 0 |
提高
|
|
|
3773 |
P1152F1 Neko Rules the Catniverse (Small Version)
|
0 / 0 |
CTSC
|
|
|
3772 |
P1152F2 Neko Rules the Catniverse (Large Version)
|
0 / 0 |
CTSC
|
|
|
3768 |
P1153D Serval and Rooted Tree
|
0 / 0 |
普及
|
|
|
3766 |
P1153F Serval and Bonus Problem
|
0 / 0 |
CTSC
|
|
|
3760 |
P1154F Shovels Shop
|
0 / 0 |
提高
|
|
|
3755 |
P1155D Beautiful Array
|
0 / 0 |
普及
|
|
|
3753 |
P1155F Delivery Oligopoly
|
0 / 0 |
CTSC
|
|
|
3749 |
P1156D 0-1-Tree
|
0 / 0 |
省选
|
|
|
3747 |
P1156F Card Bag
|
0 / 0 |
省选
|
|
|
3739 |
P1157F Maximum Balanced Circle
|
0 / 0 |
提高
|
|
|
3732 |
P1158F Density of subarrays
|
0 / 0 |
CTSC
|
|
|
3721 |
P1163D Mysterious Code
|
0 / 0 |
提高
|
|
|
3696 |
P1168C And Reachability
|
0 / 0 |
省选
|
|
|
3695 |
P1168D Anagram Paths
|
0 / 0 |
CTSC
|
|
|
3683 |
P1170I Good Subsets
|
0 / 0 |
暂无评定
|
|
|
3681 |
P1172B Nauuo and Circle
|
0 / 0 |
普及
|
|
|
3680 |
P1172C1 Nauuo and Pictures (easy version)
|
0 / 0 |
省选
|
|
|
3679 |
P1172C2 Nauuo and Pictures (hard version)
|
0 / 0 |
CTSC
|
|
|
3669 |
P1174E Ehab and the Expected GCD Problem
|
0 / 0 |
NOI
|
|
|
3663 |
P1175E Minimal Segment Cover
|
0 / 0 |
省选
|
|
|
3661 |
P1175G Yet Another Partiton Problem
|
0 / 0 |
CTSC
|
|
|
3658 |
P1176C Lose it!
|
0 / 0 |
普及-
|
|
|
3655 |
P1176F Destroy it!
|
0 / 0 |
提高
|
|
|
3651 |
P1178B WOW Factor
|
0 / 0 |
普及-
|
|
|
3647 |
P1178F1 Short Colorful Strip
|
0 / 0 |
省选
|
|
|
3646 |
P1178F2 Long Colorful Strip
|
0 / 0 |
CTSC
|
