Problem Set - OpenJudge

	ID	Problem
	21302	P8119 Rainbow Dragon Cave Tour
	21303	P8120 Longest Beautiful Subsequence Query
	21304	P8121 Robot Bullet-Dodging Simulation
	21305	P8122 Book Selection for AK BalticOI
	21306	P8123 Data Sharing Among Servers
	21307	P8125 Rebellion in the Prison
	21308	P8126 Interactive Museum Exhibit Ranking
	21309	P8127 Minimum Toggle Operations on a Tree
	21310	P8128 Finding the Optimal Stable Card Location
	21311	P8129 ICPC Road Signs
	21312	P8130 Perfect Shot of the Domes
	21313	P8131 Optimized Genetic Sequence Folding
	21314	P8132 Realistic Landscape Simulation
	21315	P8133 Maximum Points in a Thick Line
	21316	P8134 Minimum Opportunity Cost Phone
	21317	P8135 Identifying Malfunctioning QC Machines
	21318	P8136 Maximizing Quest Rewards
	21319	P8137 Minimizing Snow Blower Travel Distance
	21320	P8138 Robotic Surface Collision
	21321	P8139 Minefield Probability Queries
	21322	P8140 Optimizing Bundle Price Trailing Digits
	21323	P8141 Reconstructing Flavor Embeddings
	21324	P8142 Interstellar Map Matching
	21325	P8143 Permutation Generation Graph with Even Cycles
	21326	P8144 Infinite Game on the Number Line
	21327	P8145 Lexicographical Kth Corresponding Sequence Sum
	21328	P8146 Set and Sequence Query
	21329	P8147 Music Mode Beauty
	21330	P8148 Reconstructing a Non‐decreasing Array from Contiguous Subarray Sums
	21331	P8149 Emotional Entanglement
	21332	P8150 Recover the Password
	21333	P8151 Fate and the Tarot Shuffle
	21334	P8152 Square Splitting Challenge
	21335	P8153 Maximizing Adjacent Identical Pairs in Appended Binary Strings
	21336	P8154 Chessboard Line Puzzle
	21337	P8155 GCD Transformation Operations
	21338	P8156 Matrix Reconstruction from Row and Column Sums with Constraints
	21339	P8157 Maximum Subrectangle Area after Decrement Operations
	21340	P8158 Central Moments of Force Components on a Unit Circle
	21341	P8159 Non-Adjacent Box Selection
	21342	P8160 Castella Splitting
	21343	P8161 Maximizing Minimum Course Understanding
	21344	P8162 Minimizing Speech Time for Electoral Victory
	21345	P8163 Minimizing Train Rides Under Boarding Restrictions
	21346	P8164 Counting Rectangular Decreasing Paths
	21347	P8165 Array Rotation and Contiguous Subarray Sum Queries
	21348	P8166 Determine K-Array Values
	21349	P8167 Gray Matrix Construction
	21350	P8168 Minimizing Binary Search Mismatch
	21351	P8169 Worst-Case Coin Collection
	21352	P8170 Minimize the Maximum Bush Height
	21353	P8171 Minimizing Total Diversity of Rearranged Subarrays
	21354	P8172 Domino Tiling on a Partially Removed Grid
	21355	P8173 Ankica and Branko’s Pursuit Game
	21356	P8174 Ankica's Stone Game
	21357	P8175 Wilco's Candy Purchase Under Tom's Interference
	21358	P8176 Unique Vertex on Every K-Vertex Path
	21359	P8177 Arithmetic Sequence Insertion Game
	21360	P8178 Prime Factor Recurrence
	21361	P8179 Minimize Total Race Time
	21362	P8180 Permutation Restoration
	21363	P8181 Josephus Variant Summation
	21364	P8182 Minimum Operations to Transform Sequence
	21365	P8183 Equal Sleep Log Transformation
	21366	P8184 Cow Photography Order
	21367	P8185 Bessie's Vocabulary Challenge
	21368	P8186 Cow Gift Reassignment
	21369	P8187 Robot Instruction Subset Sum
	21370	P8188 Filing Farmer John’s Emails
	21371	P8189 Valid Gift Reassignment
	21372	P8190 Cow Camp Final Problem
	21373	P8191 Minimum Communication Network Cost
	21374	P8192 Bessie’s Cow Painting
	21375	P8193 Uniform Sleep Count Transformation
	21376	P8194 Bessie's Phone Keypress Permutations
	21377	P8195 Count Occurrences of 'chuanzhi' Substring
	21378	P8196 Counting Magic Triplets
	21379	P8197 Beautiful Queue Formation
	21380	P8199 Grid Survival and Inventory Management
	21381	P8200 XOR Distance Query on a Tree
	21382	P8201 XOR Distance in a Tree
	21383	P8202 Colorful Tree Coloring
	21384	P8203 Template Substring Query
	21385	P8204 Constructing a Valid Operation Sequence
	21386	P8205 Ancestor Edge Query
	21387	P8207 Lowest Common Tree
	21388	P8208 Expected Nonsense Index
	21389	P8209 Boxing Club Scheduling – Median Revenue of Lewis’s Optimal Schemes
	21390	P8210 Restoring Memory Order via Unique Swap Instructions
	21391	P8211 Special Brick Moving
	21392	P8212 Minimum Area of an Inscribed Convex K-gon
	21393	P8213 Optimal Chessboard Game Strategy
	21394	P8215 Minimize Total Dissatisfaction
	21395	P8216 THUPC Logo Verification
	21396	P8217 Counting Cubes
	21397	P8218 Interval Sum Queries
	21398	P8219 Maximum Proper Divisor
	21399	P8220 Minimum Time to Finish the Race
	21400	P8221 Matrix Flip Transformation
	21401	P8222 Illumination Operations

Pick a problem randomly based on the current filter.