Problem Set - OpenJudge

	ID	Problem
	17302	P4054 Grid Weight Queries
	17303	P4055 Maze Game for the Movie Ticket
	17304	P4056 Treasure Map Journey
	17305	P4057 Tsinghua Morning Run Reunion
	17306	P4058 Timber Order Fulfillment
	17307	P4059 DNA Sequence Alignment
	17308	P4060 Minimizing the Sum of XOR Prefixes
	17309	P4061 Ambush on the Devil
	17310	P4062 Counting Novel Dance Subarrays
	17311	P4063 Constructing Constrained Sequences
	17312	P4064 Maximize Minimum Value after Interval Additions
	17313	P4065 Color Deletion
	17314	P4066 Dual PACMAN Bean Harvest
	17315	P4067 Energy Table Decay
	17316	P4068 Maximum Safe Pairing
	17317	P4069 Alice and Bob's Tree Game
	17318	P4070 Counting Distinct Magic Substrings
	17319	P4071 Fixed Point Permutations
	17320	P4072 Minimizing Daily Journey Variance
	17321	P4073 Minimizing the Maximum Weight Crossing in a Planar Subdivision
	17322	P4074 Candyland Happiness
	17323	P4075 Counting Repeated Pattern Paths in a Tree
	17324	P4076 Minimizing Reversible Words in an Archaeological Grid
	17325	P4077 Alice and Bob's Coin Flipping Game
	17326	P4078 Jungle Expedition Maximum Gain
	17327	P4079 Composite Gear Transmission Consistency
	17328	P4080 Dice Landing Probability
	17329	P4081 Cow Name Uniqueness
	17330	P4082 Push a Box
	17331	P4083 Pie Exchange
	17332	P4084 Barn Painting
	17333	P4085 Minimum Spiciness Haybale Meal
	17334	P4086 Maximized Grading Average After Discarding Lowest Score
	17335	P4087 Milk Measurement
	17336	P4088 Manure Slingshot Optimization
	17337	P4089 Bovine Shuffle Permanency
	17338	P4090 Cow Gift Queue
	17339	P4091 Computation with Stirling Numbers of the Second Kind
	17340	P4092 Marked Ancestor Query on a Tree
	17341	P4093 Robust Non-decreasing Subsequence
	17342	P4094 Longest Common Substring Query
	17343	P4095 Eden's Memory: Multi-Pack Knapsack Puzzle
	17344	P4096 Critical Leaf Nodes in a Two‐Player Game Tree
	17345	P4097 Line Segment Intersection Query Problem
	17346	P4098 Gem Fusion XOR
	17347	P4099 Lexicographically Smallest Level Ordering
	17348	P4100 Backup Chef Robots Pairing
	17349	P4101 Zealot Round-game Stones
	17350	P4102 Distinct Paths Stamina Cost
	17351	P4103 Building New Channels Over a Tree Network
	17352	P4104 Balanced Seesaw Eraser Removal
	17353	P4105 Non‐Decreasing Sequence Transformation
	17354	P4106 Neural Polynomial Transformation
	17355	P4107 Maximizing Node Deletions on a Load‐Constrained Cherry Blossom Tree
	17356	P4108 Dynamic GCD and XOR Prefix Query
	17357	P4109 The Most Absurd Price
	17358	P4110 Scheduling Activities to Minimize Expected Loss
	17359	P4111 Counting Unique Spanning Trees in a House
	17360	P4112 Reverse the LCS: Minimal Excluded Substrings and Subsequences
	17361	P4113 Flower Picking Princess
	17362	P4114 Dynamic Tree Maximum Edge Query
	17363	P4115 Tree Coloring and Longest White Node Distance
	17364	P4116 Tree Path Black Query
	17365	P4117 Sequence Operation Queries
	17366	P4118 Range Addition and Maximum Subarray Sum Query
	17367	P4119 Sequence Updates and \(k\)th Smallest Query
	17368	P4120 Unique Minimum Spanning Tree Adjustment
	17369	P4121 Chessboard Flip Connectivity
	17370	P4122 Blocked Billboard
	17371	P4123 Distinct Minimum Cut Values
	17372	P4124 Mobile Number Feature Count
	17373	P4125 Needle Leaf Game
	17374	P4126 Minimum Cut Query Analysis
	17375	P4127 Divisible by Digit Sum Count
	17376	P4128 Counting Non-Isomorphic Colored Complete Graphs
	17377	P4129 Cactus Spanning Subgraph Count
	17378	P4130 Necklace Commands
	17379	P4131 W Planet Organisms’ Friendliness
	17380	P4132 Puzzle Door: Prime Password
	17381	P4133 Disjoint Fibonacci Sum Representations
	17382	P4134 Square Difference Pair Elimination
	17383	P4135 Even Frequency Types
	17384	P4136 Unvisited Cells Game
	17385	P4137 Find the Mex in Subarrays
	17386	P4138 JOI Decorations Maximization
	17387	P4139 The Ultimate Element
	17388	P4140 Totient Query on Bank Deposits
	17389	P4141 Knapsack Count with a Missing Item
	17390	P4142 Cave Support Optimization
	17391	P4143 Collectible Substrings
	17392	P4144 Sock Sequence Dirty Value
	17393	P4145 Sequence Modification and Query
	17394	P4146 Segment Operations with Reversal and Range Maximum Query
	17395	P4147 Largest 'F' Subrectangle
	17396	P4148 Grid Sum Query and Update
	17397	P4149 Minimum-Edge k-Sum Path in a Tree
	17398	P4150 Shortest Path Queries on a 6×n Grid
	17399	P4151 Maximum XOR Path
	17400	P4152 Spaceship Navigation in n-Dimensional Space
	17401	P4153 K Smallest s-t Cuts

Pick a problem randomly based on the current filter.