Problem Set - OpenJudge

	ID	Problem
	13148	P11091 Chronological Improvements
	13149	P11092 Maximum Moscow Number
	13150	P11093 Gadget Partition
	13151	P11094 Maximum Safe Tree Felling in a Query Range
	13152	P11095 Minimizing Combined Video Duration on Routes
	13153	P11096 Maximizing Separation After a Sorting Operation
	13154	P11097 Minimizing Equipment Purchase Cost under Subtree Constraints
	13155	P11098 George and the Water Park Pipes
	13156	P11099 Maximizing Illuminated Area with Directional Lamps
	13158	P11100 Maximum Optimal Multiple
	13159	P11101 Round Experience and Level Queries
	13160	P11102 Forklift Delivery Time
	13161	P11103 Optimal Part Allocation in Containers
	13162	P11104 Image Grid Compactness
	13163	P11105 BASE23 Encryption and Decryption
	13164	P11106 Maximizing Peaks and Valleys in Permutation Split
	13165	P11107 Counting Mex‐Stable Sets
	13166	P11108 Snail's Descent Turn-limited Path Counting
	13167	P11109 Select Meetings with Specified Compatibility
	13169	P11110 K-Perfect Pair
	13170	P11111 Efficient Plan Verification
	13171	P11112 Robot Delivery Profit Maximization
	13172	P11113 Chessboard Operation Simulation
	13173	P11114 Minimum Flight Service Trolley Movement Distance
	13174	P11115 Robot Service Statistics
	13175	P11116 Minimum Robot Flips for Lawn Mowing
	13176	P11117 Illuminating the Campus
	13177	P11118 Drone Transmission Calculation
	13178	P11119 Minimizing Road Instability via Antenna Replacement
	13180	P11120 Symmetric Seating Arrangement
	13181	P11121 Counting Bitonic Subarrays
	13182	P11122 Table Transformation to Achieve Target Sum
	13183	P11123 Minimum Reachability in Augmented Tree
	13184	P11124 Coloring Array with Prime Multiplication Constraint
	13185	P11125 Determining Time for Exact Colony Size
	13186	P11126 Count Triplet Partitionings of an Array
	13187	P11127 Binary Tree DFS Order Query
	13188	P11128 Exact Difference Pair
	13189	P11129 Counting Subarrays with Integer Average in an Arithmetic Progression
	13191	P11130 Transforming Integer via GCD Multiplication
	13192	P11131 Minimize Maximum Weight Sum Meeting
	13193	P11132 Maximum Permutation Value
	13194	P11133 Interactive Stone Piles Game
	13195	P11134 Minimum Spanning Tree on Intersecting Segments
	13196	P11135 Extremely Good Permutations
	13197	P11136 Magical Compressed Towel
	13198	P11137 Duplicate Problem Titles
	13199	P11138 APC String Reduction
	13200	P11139 Maintaining a Sequence
	13202	P11140 Non‐Boring Partitioning of a Linear Map
	13203	P11141 Minimum Number of Expansion Operations
	13204	P11142 Minimizing Goods Value Loss in Factory Logistics
	13205	P11143 Optimal Cake Cutting Game
	13206	P11144 Interactive Guessing Game with Limited Queries
	13207	P11145 Interactive Guessing Game: Flame and Circle
	13208	P11146 Maximizing Train Carriage Comfort
	13209	P11147 Dino’s Infinite Run
	13210	P11148 Maximizing Yazid's Snack Happiness
	13211	P11149 Connected Subtrees with Limited Team Diversity
	13213	P11150 Lexicographically Smallest Insertion Position
	13214	P11151 Minimize Fuel Cost for Sunrise Journey
	13215	P11152 Avoiding Balanced Prefixes and Suffixes
	13216	P11153 Corner Detection in Grayscale Images
	13217	P11154 Arcaea Score Rating Calculation
	13218	P11155 Dependency Scoring
	13219	P11156 Sequence Reconstruction
	13220	P11157 Finding a Valid Shift
	13221	P11158 Swapped Rows and Zero‐Gravity Regions
	13222	P11159 Heavy Chain Decomposition
	13224	P11160 Multiset Maintenance and Bitwise Lowbit Operations
	13225	P11161 Hamiltonian Cycle on a Weighted Tree-Induced Complete Graph
	13226	P11162 Car Race
	13227	P11163 Weights
	13228	P11164 Permutations with Bounded Longest Decreasing Subsequence
	13229	P11165 Super Tree Energy
	13230	P11166 Save the Vine!
	13231	P11167 Aliens and Planetary Paths
	13232	P11168 Minimum Grid Point Selection
	13233	P11169 Modified Sieve Counting
	13235	P11170 XOR Graph Path Construction
	13236	P11171 Constructing a Sequence with a Given MEX Sum
	13237	P11172 Construct Sequence with Specified \(\mathrm{mex}\) Sum
	13238	P11173 Nilpotent Matrix Power Sum
	13239	P11174 Double Spanning Tree Sum
	13240	P11175 Discrete Logarithm with Primitive Root
	13241	P11176 Achieving Minimum Final Grade
	13242	P11177 Squares and Cubes
	13243	P11178 Elevator Simulation
	13244	P11179 Pipeline Monitoring
	13246	P11180 Deletion of Numbers
	13247	P11181 Minimizing Illustration Pages
	13248	P11182 Beauty of Fireworks
	13249	P11183 Memory Assignment Minimization
	13250	P11184 Possible Remainders in Division with Remainder
	13251	P11185 Best Possible Ranking
	13252	P11186 Evaluate Ternary Constant Expression
	13253	P11187 Maximum Paired Subsequence
	13254	P11188 Minimum Deletion Cost
	13255	P11189 Water Temperature Reduction on a Rooted Tree
	13257	P11190 Maximal Non‐Palindromic Subsequence Partitioning

Pick a problem randomly based on the current filter.