|
|
3163 |
P1152D
Neko and Aki's Prank
|
0 / 0 |
7 |
|
|
3162 |
P1152E
Neko and Flashback
|
0 / 0 |
9 |
|
|
3161 |
P1152F1
Neko Rules the Catniverse (Small Version)
|
0 / 0 |
10 |
|
|
3160 |
P1152F2
Neko Rules the Catniverse (Large Version)
|
0 / 0 |
10 |
|
|
3159 |
P1153A
Serval and Bus
|
0 / 0 |
3 |
|
|
3158 |
P1153B
Serval and Toy Bricks
|
0 / 0 |
4 |
|
|
3157 |
P1153C
Serval and Parenthesis Sequence
|
0 / 0 |
5 |
|
|
3156 |
P1153D
Serval and Rooted Tree
|
0 / 0 |
6 |
|
|
3155 |
P1153E
Serval and Snake
|
0 / 0 |
8 |
|
|
3154 |
P1153F
Serval and Bonus Problem
|
0 / 0 |
10 |
|
|
3153 |
P1154A
Restoring Three Numbers
|
0 / 0 |
3 |
|
|
3152 |
P1154B
Make Them Equal
|
0 / 0 |
4 |
|
|
3151 |
P1154C
Gourmet Cat
|
0 / 0 |
4 |
|
|
3150 |
P1154D
Walking Robot
|
0 / 0 |
5 |
|
|
3149 |
P1154E
Two Teams
|
0 / 0 |
6 |
|
|
3148 |
P1154F
Shovels Shop
|
0 / 0 |
7 |
|
|
3147 |
P1154G
Minimum Possible LCM
|
0 / 0 |
8 |
|
|
3146 |
P1155A
Reverse a Substring
|
0 / 0 |
3 |
|
|
3145 |
P1155B
Game with Telephone Numbers
|
0 / 0 |
4 |
|
|
3144 |
P1155C
Alarm Clocks Everywhere
|
0 / 0 |
4 |
|
|
3143 |
P1155D
Beautiful Array
|
0 / 0 |
6 |
|
|
3142 |
P1155E
Guess the Root
|
0 / 0 |
8 |
|
|
3141 |
P1155F
Delivery Oligopoly
|
0 / 0 |
10 |
|
|
3140 |
P1156A
Inscribed Figures
|
0 / 0 |
4 |
|
|
3139 |
P1156B
Ugly Pairs
|
0 / 0 |
6 |
|
|
3138 |
P1156C
Match Points
|
0 / 0 |
7 |
|
|
3137 |
P1156D
0-1-Tree
|
0 / 0 |
8 |
|
|
3136 |
P1156E
Special Segments of Permutation
|
0 / 0 |
8 |
|
|
3135 |
P1156F
Card Bag
|
0 / 0 |
8 |
|
|
3134 |
P1156G
Optimizer
|
0 / 0 |
10 |
|
|
3133 |
P1157A
Reachable Numbers
|
0 / 0 |
3 |
|
|
3132 |
P1157B
Long Number
|
0 / 0 |
4 |
|
|
3131 |
P1157C1
Increasing Subsequence (easy version)
|
0 / 0 |
4 |
|
|
3130 |
P1157C2
Increasing Subsequence (hard version)
|
0 / 0 |
5 |
|
|
3129 |
P1157D
N Problems During K Days
|
0 / 0 |
6 |
|
|
3128 |
P1157E
Minimum Array
|
0 / 0 |
5 |
|
|
3127 |
P1157F
Maximum Balanced Circle
|
0 / 0 |
7 |
|
|
3126 |
P1157G
Inverse of Rows and Columns
|
0 / 0 |
8 |
|
|
3125 |
P1158A
The Party and Sweets
|
0 / 0 |
5 |
|
|
3124 |
P1158B
The minimal unique substring
|
0 / 0 |
8 |
|
|
3123 |
P1158C
Permutation recovery
|
0 / 0 |
7 |
|
|
3122 |
P1158D
Winding polygonal line
|
0 / 0 |
10 |
|
|
3121 |
P1158E
Strange device
|
0 / 0 |
10 |
|
|
3120 |
P1158F
Density of subarrays
|
0 / 0 |
10 |
|
|
3119 |
P1159A
A pile of stones
|
0 / 0 |
3 |
|
|
3118 |
P1159B
Expansion coefficient of the array
|
0 / 0 |
4 |
|
|
3117 |
P1160A2
Collaboration
|
0 / 0 |
(无) |
|
|
3116 |
P1162A
Zoning Restrictions Again
|
0 / 0 |
3 |
|
|
3115 |
P1162B
Double Matrix
|
0 / 0 |
4 |
|
|
3114 |
P1163A
Eating Soup
|
0 / 0 |
3 |
|
|
3113 |
P1163B1
Cat Party (Easy Edition)
|
0 / 0 |
5 |
|
|
3112 |
P1163B2
Cat Party (Hard Edition)
|
0 / 0 |
5 |
|
|
3111 |
P1163C1
Power Transmission (Easy Edition)
|
0 / 0 |
6 |
|
|
3110 |
P1163C2
Power Transmission (Hard Edition)
|
0 / 0 |
6 |
|
|
3109 |
P1163D
Mysterious Code
|
0 / 0 |
7 |
|
|
3108 |
P1163E
Magical Permutation
|
0 / 0 |
9 |
|
|
3107 |
P1163F
Indecisive Taxi Fee
|
0 / 0 |
10 |
|
|
3106 |
P1165A
Remainder
|
0 / 0 |
3 |
|
|
3105 |
P1165B
Polycarp Training
|
0 / 0 |
3 |
|
|
3104 |
P1165C
Good String
|
0 / 0 |
4 |
|
|
3103 |
P1165D
Almost All Divisors
|
0 / 0 |
5 |
|
|
3102 |
P1165E
Two Arrays and Sum of Functions
|
0 / 0 |
5 |
|
|
3101 |
P1165F1
Microtransactions (easy version)
|
0 / 0 |
7 |
|
|
3100 |
P1165F2
Microtransactions (hard version)
|
0 / 0 |
7 |
|
|
3099 |
P1166A
Silent Classroom
|
0 / 0 |
3 |
|
|
3098 |
P1166B
All the Vowels Please
|
0 / 0 |
3 |
|
|
3097 |
P1166C
A Tale of Two Lands
|
0 / 0 |
5 |
|
|
3096 |
P1166D
Cute Sequences
|
0 / 0 |
8 |
|
|
3095 |
P1166E
The LCMs Must be Large
|
0 / 0 |
7 |
|
|
3094 |
P1166F
Vicky's Delivery Service
|
0 / 0 |
9 |
|
|
3093 |
P1167A
Telephone Number
|
0 / 0 |
3 |
|
|
3092 |
P1167B
Lost Numbers
|
0 / 0 |
4 |
|
|
3091 |
P1167C
News Distribution
|
0 / 0 |
4 |
|
|
3090 |
P1167D
Bicolored RBS
|
0 / 0 |
5 |
|
|
3089 |
P1167E
Range Deleting
|
0 / 0 |
7 |
|
|
3088 |
P1167F
Scalar Queries
|
0 / 0 |
8 |
|
|
3087 |
P1167G
Low Budget Inception
|
0 / 0 |
10 |
|
|
3086 |
P1168A
Increasing by Modulo
|
0 / 0 |
5 |
|
|
3085 |
P1168B
Good Triple
|
0 / 0 |
6 |
|
|
3084 |
P1168C
And Reachability
|
0 / 0 |
8 |
|
|
3083 |
P1168D
Anagram Paths
|
0 / 0 |
10 |
|
|
3082 |
P1168E
Xor Permutations
|
0 / 0 |
10 |
|
|
3081 |
P1169A
Circle Metro
|
0 / 0 |
3 |
|
|
3080 |
P1169B
Pairs
|
0 / 0 |
5 |
|
|
3079 |
P1170A
Three Integers Again
|
0 / 0 |
(无) |
|
|
3078 |
P1170B
Bad Days
|
0 / 0 |
(无) |
|
|
3077 |
P1170C
Minus and Minus Give Plus
|
0 / 0 |
(无) |
|
|
3076 |
P1170D
Decoding of Integer Sequences
|
0 / 0 |
(无) |
|
|
3075 |
P1170E
Sliding Doors
|
0 / 0 |
(无) |
|
|
3074 |
P1170F
Wheels
|
0 / 0 |
(无) |
|
|
3073 |
P1170G
Graph Decomposition
|
0 / 0 |
(无) |
|
|
3072 |
P1170H
Longest Saw
|
0 / 0 |
(无) |
|
|
3071 |
P1170I
Good Subsets
|
0 / 0 |
(无) |
|
|
3070 |
P1172A
Nauuo and Cards
|
0 / 0 |
6 |
|
|
3069 |
P1172B
Nauuo and Circle
|
0 / 0 |
6 |
|
|
3068 |
P1172C1
Nauuo and Pictures (easy version)
|
0 / 0 |
8 |
|
|
3067 |
P1172C2
Nauuo and Pictures (hard version)
|
0 / 0 |
10 |
|
|
3066 |
P1172D
Nauuo and Portals
|
0 / 0 |
10 |
|
|
3065 |
P1172E
Nauuo and ODT
|
0 / 0 |
10 |
|
|
3064 |
P1172F
Nauuo and Bug
|
0 / 0 |
10 |
