|
|
3937 |
P1152D
Neko and Aki's Prank
|
0 / 0 |
7 |
|
|
3936 |
P1152E
Neko and Flashback
|
0 / 0 |
9 |
|
|
3935 |
P1152F1
Neko Rules the Catniverse (Small Version)
|
0 / 0 |
10 |
|
|
3934 |
P1152F2
Neko Rules the Catniverse (Large Version)
|
0 / 0 |
10 |
|
|
3933 |
P1153A
Serval and Bus
|
0 / 0 |
3 |
|
|
3932 |
P1153B
Serval and Toy Bricks
|
0 / 0 |
4 |
|
|
3931 |
P1153C
Serval and Parenthesis Sequence
|
0 / 0 |
5 |
|
|
3930 |
P1153D
Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
3929 |
P1153E
Serval and Snake
|
0 / 0 |
8 |
|
|
3928 |
P1153F
Serval and Bonus Problem
|
0 / 0 |
10 |
|
|
3927 |
P1154A
Restoring Three Numbers
|
0 / 0 |
3 |
|
|
3926 |
P1154B
Make Them Equal
|
0 / 0 |
4 |
|
|
3925 |
P1154C
Gourmet Cat
|
0 / 0 |
4 |
|
|
3924 |
P1154D
Walking Robot
|
0 / 0 |
5 |
|
|
3923 |
P1154E
Two Teams
|
0 / 0 |
6 |
|
|
3922 |
P1154F
Shovels Shop
|
0 / 0 |
7 |
|
|
3921 |
P1154G
Minimum Possible LCM
|
0 / 0 |
8 |
|
|
3920 |
P1155A
Reverse a Substring
|
0 / 0 |
3 |
|
|
3919 |
P1155B
Game with Telephone Numbers
|
0 / 0 |
4 |
|
|
3918 |
P1155C
Alarm Clocks Everywhere
|
0 / 0 |
4 |
|
|
3917 |
P1155D
Beautiful Array
|
0 / 0 |
6 |
|
|
3916 |
P1155E
Guess the Root
|
0 / 0 |
8 |
|
|
3915 |
P1155F
Delivery Oligopoly
|
0 / 0 |
10 |
|
|
3914 |
P1156A
Inscribed Figures
|
0 / 0 |
4 |
|
|
3913 |
P1156B
Ugly Pairs
|
0 / 0 |
6 |
|
|
3912 |
P1156C
Match Points
|
0 / 0 |
7 |
|
|
3911 |
P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
3910 |
P1156E
Special Segments of Permutation
|
0 / 0 |
8 |
|
|
3909 |
P1156F
Card Bag
|
0 / 0 |
8 |
|
|
3908 |
P1156G
Optimizer
|
0 / 0 |
10 |
|
|
3907 |
P1157A
Reachable Numbers
|
0 / 0 |
3 |
|
|
3906 |
P1157B
Long Number
|
0 / 0 |
4 |
|
|
3905 |
P1157C1
Increasing Subsequence (easy version)
|
0 / 0 |
4 |
|
|
3904 |
P1157C2
Increasing Subsequence (hard version)
|
0 / 0 |
5 |
|
|
3903 |
P1157D
N Problems During K Days
|
0 / 0 |
6 |
|
|
3902 |
P1157E
Minimum Array
|
0 / 0 |
5 |
|
|
3901 |
P1157F
Maximum Balanced Circle
|
0 / 0 |
7 |
|
|
3900 |
P1157G
Inverse of Rows and Columns
|
0 / 0 |
8 |
|
|
3899 |
P1158A
The Party and Sweets
|
0 / 0 |
5 |
|
|
3898 |
P1158B
The minimal unique substring
|
0 / 0 |
8 |
|
|
3897 |
P1158C
Permutation recovery
|
0 / 0 |
7 |
|
|
3896 |
P1158D
Winding polygonal line
|
0 / 0 |
10 |
|
|
3895 |
P1158E
Strange device
|
0 / 0 |
10 |
|
|
3894 |
P1158F
Density of subarrays
|
0 / 0 |
10 |
|
|
3893 |
P1159A
A pile of stones
|
0 / 0 |
3 |
|
|
3892 |
P1159B
Expansion coefficient of the array
|
0 / 0 |
4 |
|
|
3891 |
P1160A2
Collaboration
|
0 / 0 |
(无) |
|
|
3890 |
P1162A
Zoning Restrictions Again
|
0 / 0 |
3 |
|
|
3889 |
P1162B
Double Matrix
|
0 / 0 |
4 |
|
|
3888 |
P1163A
Eating Soup
|
0 / 0 |
3 |
|
|
3887 |
P1163B1
Cat Party (Easy Edition)
|
0 / 0 |
5 |
|
|
3886 |
P1163B2
Cat Party (Hard Edition)
|
0 / 0 |
5 |
|
|
3885 |
P1163C1
Power Transmission (Easy Edition)
|
0 / 0 |
6 |
|
|
3884 |
P1163C2
Power Transmission (Hard Edition)
|
0 / 0 |
6 |
|
|
3883 |
P1163D
Mysterious Code
|
0 / 0 |
7 |
|
|
3882 |
P1163E
Magical Permutation
|
0 / 0 |
9 |
|
|
3881 |
P1163F
Indecisive Taxi Fee
|
0 / 0 |
10 |
|
|
3880 |
P1165A
Remainder
|
0 / 0 |
3 |
|
|
3879 |
P1165B
Polycarp Training
|
0 / 0 |
3 |
|
|
3878 |
P1165C
Good String
|
0 / 0 |
4 |
|
|
3877 |
P1165D
Almost All Divisors
|
0 / 0 |
5 |
|
|
3876 |
P1165E
Two Arrays and Sum of Functions
|
0 / 0 |
5 |
|
|
3875 |
P1165F1
Microtransactions (easy version)
|
0 / 0 |
7 |
|
|
3874 |
P1165F2
Microtransactions (hard version)
|
0 / 0 |
7 |
|
|
3873 |
P1166A
Silent Classroom
|
0 / 0 |
3 |
|
|
3872 |
P1166B
All the Vowels Please
|
0 / 0 |
3 |
|
|
3871 |
P1166C
A Tale of Two Lands
|
0 / 0 |
5 |
|
|
3870 |
P1166D
Cute Sequences
|
0 / 0 |
8 |
|
|
3869 |
P1166E
The LCMs Must be Large
|
0 / 0 |
7 |
|
|
3868 |
P1166F
Vicky's Delivery Service
|
0 / 0 |
9 |
|
|
3867 |
P1167A
Telephone Number
|
0 / 0 |
3 |
|
|
3866 |
P1167B
Lost Numbers
|
0 / 0 |
4 |
|
|
3865 |
P1167C
News Distribution
|
0 / 0 |
4 |
|
|
3864 |
P1167D
Bicolored RBS
|
0 / 0 |
5 |
|
|
3863 |
P1167E
Range Deleting
|
0 / 0 |
7 |
|
|
3862 |
P1167F
Scalar Queries
|
0 / 0 |
8 |
|
|
3861 |
P1167G
Low Budget Inception
|
0 / 0 |
10 |
|
|
3860 |
P1168A
Increasing by Modulo
|
0 / 0 |
5 |
|
|
3859 |
P1168B
Good Triple
|
0 / 0 |
6 |
|
|
3858 |
P1168C
And Reachability
|
0 / 0 |
8 |
|
|
3857 |
P1168D
Anagram Paths
|
0 / 0 |
10 |
|
|
3856 |
P1168E
Xor Permutations
|
0 / 0 |
10 |
|
|
3855 |
P1169A
Circle Metro
|
0 / 0 |
3 |
|
|
3854 |
P1169B
Pairs
|
0 / 0 |
5 |
|
|
3853 |
P1170A
Three Integers Again
|
0 / 0 |
(无) |
|
|
3852 |
P1170B
Bad Days
|
0 / 0 |
(无) |
|
|
3851 |
P1170C
Minus and Minus Give Plus
|
0 / 0 |
(无) |
|
|
3850 |
P1170D
Decoding of Integer Sequences
|
0 / 0 |
(无) |
|
|
3849 |
P1170E
Sliding Doors
|
0 / 0 |
(无) |
|
|
3848 |
P1170F
Wheels
|
0 / 0 |
(无) |
|
|
3847 |
P1170G
Graph Decomposition
|
0 / 0 |
(无) |
|
|
3846 |
P1170H
Longest Saw
|
0 / 0 |
(无) |
|
|
3845 |
P1170I
Good Subsets
|
0 / 0 |
(无) |
|
|
3844 |
P1172A
Nauuo and Cards
|
0 / 0 |
6 |
|
|
3843 |
P1172B
Nauuo and Circle
|
0 / 0 |
6 |
|
|
3842 |
P1172C1
Nauuo and Pictures (easy version)
|
0 / 0 |
8 |
|
|
3841 |
P1172C2
Nauuo and Pictures (hard version)
|
0 / 0 |
10 |
|
|
3840 |
P1172D
Nauuo and Portals
|
0 / 0 |
10 |
|
|
3839 |
P1172E
Nauuo and ODT
|
0 / 0 |
10 |
|
|
3838 |
P1172F
Nauuo and Bug
|
0 / 0 |
10 |
