|
|
3984 |
P1152D Neko and Aki's Prank
|
0 / 0 |
7 |
|
|
3983 |
P1152E Neko and Flashback
|
0 / 0 |
9 |
|
|
3982 |
P1152F1 Neko Rules the Catniverse (Small Version)
|
0 / 0 |
10 |
|
|
3981 |
P1152F2 Neko Rules the Catniverse (Large Version)
|
0 / 0 |
10 |
|
|
3980 |
P1153A Serval and Bus
|
0 / 0 |
3 |
|
|
3979 |
P1153B Serval and Toy Bricks
|
0 / 0 |
4 |
|
|
3978 |
P1153C Serval and Parenthesis Sequence
|
0 / 0 |
5 |
|
|
3977 |
P1153D Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
3976 |
P1153E Serval and Snake
|
0 / 0 |
8 |
|
|
3975 |
P1153F Serval and Bonus Problem
|
0 / 0 |
10 |
|
|
3974 |
P1154A Restoring Three Numbers
|
0 / 0 |
3 |
|
|
3973 |
P1154B Make Them Equal
|
0 / 0 |
4 |
|
|
3972 |
P1154C Gourmet Cat
|
0 / 0 |
4 |
|
|
3971 |
P1154D Walking Robot
|
0 / 0 |
5 |
|
|
3970 |
P1154E Two Teams
|
0 / 0 |
6 |
|
|
3969 |
P1154F Shovels Shop
|
0 / 0 |
7 |
|
|
3968 |
P1154G Minimum Possible LCM
|
0 / 0 |
8 |
|
|
3967 |
P1155A Reverse a Substring
|
0 / 0 |
3 |
|
|
3966 |
P1155B Game with Telephone Numbers
|
0 / 0 |
4 |
|
|
3965 |
P1155C Alarm Clocks Everywhere
|
0 / 0 |
4 |
|
|
3964 |
P1155D Beautiful Array
|
0 / 0 |
6 |
|
|
3963 |
P1155E Guess the Root
|
0 / 0 |
8 |
|
|
3962 |
P1155F Delivery Oligopoly
|
0 / 0 |
10 |
|
|
3961 |
P1156A Inscribed Figures
|
0 / 0 |
4 |
|
|
3960 |
P1156B Ugly Pairs
|
0 / 0 |
6 |
|
|
3959 |
P1156C Match Points
|
0 / 0 |
7 |
|
|
3958 |
P1156D 0-1-Tree
|
0 / 0 |
8 |
|
|
3957 |
P1156E Special Segments of Permutation
|
0 / 0 |
8 |
|
|
3956 |
P1156F Card Bag
|
0 / 0 |
8 |
|
|
3955 |
P1156G Optimizer
|
0 / 0 |
10 |
|
|
3954 |
P1157A Reachable Numbers
|
0 / 0 |
3 |
|
|
3953 |
P1157B Long Number
|
0 / 0 |
4 |
|
|
3952 |
P1157C1 Increasing Subsequence (easy version)
|
0 / 0 |
4 |
|
|
3951 |
P1157C2 Increasing Subsequence (hard version)
|
0 / 0 |
5 |
|
|
3950 |
P1157D N Problems During K Days
|
0 / 0 |
6 |
|
|
3949 |
P1157E Minimum Array
|
0 / 0 |
5 |
|
|
3948 |
P1157F Maximum Balanced Circle
|
0 / 0 |
7 |
|
|
3947 |
P1157G Inverse of Rows and Columns
|
0 / 0 |
8 |
|
|
3946 |
P1158A The Party and Sweets
|
0 / 0 |
5 |
|
|
3945 |
P1158B The minimal unique substring
|
0 / 0 |
8 |
|
|
3944 |
P1158C Permutation recovery
|
0 / 0 |
7 |
|
|
3943 |
P1158D Winding polygonal line
|
0 / 0 |
10 |
|
|
3942 |
P1158E Strange device
|
0 / 0 |
10 |
|
|
3941 |
P1158F Density of subarrays
|
0 / 0 |
10 |
|
|
3940 |
P1159A A pile of stones
|
0 / 0 |
3 |
|
|
3939 |
P1159B Expansion coefficient of the array
|
0 / 0 |
4 |
|
|
3938 |
P1160A2 Collaboration
|
0 / 0 |
(None) |
|
|
3937 |
P1162A Zoning Restrictions Again
|
0 / 0 |
3 |
|
|
3936 |
P1162B Double Matrix
|
0 / 0 |
4 |
|
|
3935 |
P1163A Eating Soup
|
0 / 0 |
3 |
|
|
3934 |
P1163B1 Cat Party (Easy Edition)
|
0 / 0 |
5 |
|
|
3933 |
P1163B2 Cat Party (Hard Edition)
|
0 / 0 |
5 |
|
|
3932 |
P1163C1 Power Transmission (Easy Edition)
|
0 / 0 |
6 |
|
|
3931 |
P1163C2 Power Transmission (Hard Edition)
|
0 / 0 |
6 |
|
|
3930 |
P1163D Mysterious Code
|
0 / 0 |
7 |
|
|
3929 |
P1163E Magical Permutation
|
0 / 0 |
9 |
|
|
3928 |
P1163F Indecisive Taxi Fee
|
0 / 0 |
10 |
|
|
3927 |
P1165A Remainder
|
0 / 0 |
3 |
|
|
3926 |
P1165B Polycarp Training
|
0 / 0 |
3 |
|
|
3925 |
P1165C Good String
|
0 / 0 |
4 |
|
|
3924 |
P1165D Almost All Divisors
|
0 / 0 |
5 |
|
|
3923 |
P1165E Two Arrays and Sum of Functions
|
0 / 0 |
5 |
|
|
3922 |
P1165F1 Microtransactions (easy version)
|
0 / 0 |
7 |
|
|
3921 |
P1165F2 Microtransactions (hard version)
|
0 / 0 |
7 |
|
|
3920 |
P1166A Silent Classroom
|
0 / 0 |
3 |
|
|
3919 |
P1166B All the Vowels Please
|
0 / 0 |
3 |
|
|
3918 |
P1166C A Tale of Two Lands
|
0 / 0 |
5 |
|
|
3917 |
P1166D Cute Sequences
|
0 / 0 |
8 |
|
|
3916 |
P1166E The LCMs Must be Large
|
0 / 0 |
7 |
|
|
3915 |
P1166F Vicky's Delivery Service
|
0 / 0 |
9 |
|
|
3914 |
P1167A Telephone Number
|
0 / 0 |
3 |
|
|
3913 |
P1167B Lost Numbers
|
0 / 0 |
4 |
|
|
3912 |
P1167C News Distribution
|
0 / 0 |
4 |
|
|
3911 |
P1167D Bicolored RBS
|
0 / 0 |
5 |
|
|
3910 |
P1167E Range Deleting
|
0 / 0 |
7 |
|
|
3909 |
P1167F Scalar Queries
|
0 / 0 |
8 |
|
|
3908 |
P1167G Low Budget Inception
|
0 / 0 |
10 |
|
|
3907 |
P1168A Increasing by Modulo
|
0 / 0 |
5 |
|
|
3906 |
P1168B Good Triple
|
0 / 0 |
6 |
|
|
3905 |
P1168C And Reachability
|
0 / 0 |
8 |
|
|
3904 |
P1168D Anagram Paths
|
0 / 0 |
10 |
|
|
3903 |
P1168E Xor Permutations
|
0 / 0 |
10 |
|
|
3902 |
P1169A Circle Metro
|
0 / 0 |
3 |
|
|
3901 |
P1169B Pairs
|
0 / 0 |
5 |
|
|
3900 |
P1170A Three Integers Again
|
0 / 0 |
(None) |
|
|
3899 |
P1170B Bad Days
|
0 / 0 |
(None) |
|
|
3898 |
P1170C Minus and Minus Give Plus
|
0 / 0 |
(None) |
|
|
3897 |
P1170D Decoding of Integer Sequences
|
0 / 0 |
(None) |
|
|
3896 |
P1170E Sliding Doors
|
0 / 0 |
(None) |
|
|
3895 |
P1170F Wheels
|
0 / 0 |
(None) |
|
|
3894 |
P1170G Graph Decomposition
|
0 / 0 |
(None) |
|
|
3893 |
P1170H Longest Saw
|
0 / 0 |
(None) |
|
|
3892 |
P1170I Good Subsets
|
0 / 0 |
(None) |
|
|
3891 |
P1172A Nauuo and Cards
|
0 / 0 |
6 |
|
|
3890 |
P1172B Nauuo and Circle
|
0 / 0 |
6 |
|
|
3889 |
P1172C1 Nauuo and Pictures (easy version)
|
0 / 0 |
8 |
|
|
3888 |
P1172C2 Nauuo and Pictures (hard version)
|
0 / 0 |
10 |
|
|
3887 |
P1172D Nauuo and Portals
|
0 / 0 |
10 |
|
|
3886 |
P1172E Nauuo and ODT
|
0 / 0 |
10 |
|
|
3885 |
P1172F Nauuo and Bug
|
0 / 0 |
10 |
