Problem Set - OpenJudge

	ID	Problem
	13699	P11604 Optimal Card Discard Strategy
	13700	P11605 Construct a Valid Expression with Ones
	13701	P11606 Construct a Rooted Tree with Ancestor Constraints
	13702	P11607 Interactive Chebyshev Search
	13703	P11608 Mushroom Harvest
	13705	P11611 Counting Satisfying Assignments in a Special SAT Formula
	13706	P11612 Ball Trajectory on a Hilbert Curve
	13707	P11613 Counting Graphs with a Given Minimum Vertex Cover Parity
	13708	P11614 Preemptive Task Scheduling on Multiple Processors
	13709	P11615 Mapping Update and Query
	13710	P11616 Strictly Increasing Segments Partition
	13711	P11617 Infinite Sequence Sum with Recurrence
	13712	P11618 Probability of Isomorphic Increasing Tree
	13713	P11619 Non-crossing Intervals
	13715	P11620 XOR Subset Query and Update
	13716	P11621 Weighted Point Operations
	13717	P11622 Sequence Walk Query
	13718	P11624 Counting Correct FakeLCA Pairs in a Rooted Tree
	13719	P11625 Counting Inversion Subarrays
	13720	P11626 Seven GCD Strikes
	13721	P11627 Maximizing Score on a Weighted Tree Game
	13723	P11637 Minimizing A and B with Modular Incrementation
	13724	P11638 Maximizing the Array Sum via MEX Operations
	13725	P11639 Music Game Bot Optimization
	13727	P11640 Graph Coloring and Path Constraints
	13728	P11641 Regrading Exams Final Score
	13729	P11642 Maximum Array Sum by Single Segment Replacement
	13730	P11643 Mio's Sequence Transformation
	13731	P11644 Sabotage Running Check-In
	13732	P11645 Counting AI Tree Structures
	13733	P11646 Counting Good Connections
	13734	P11647 Reconstruct the Hidden Array
	13735	P11648 Subtree Pair Value Sum on a Colored Tree
	13736	P11649 Chess Pieces Attack Coverage
	13738	P11650 Minimum Restaurant Stops on the Number Line
	13739	P11651 XOR Sum of Pair Sums
	13740	P11652 Minimal Shoe Retrieval Time
	13741	P11653 Minimum Cycle Covering Directed Cat‐Edges
	13742	P11654 becoder Evaluation Challenge
	13743	P11655 Summing Maximum Color Segments
	13744	P11656 Minimum Coin Activation for Alcohol Spray Coverage
	13745	P11657 Online Longest Valid Parentheses
	13746	P11658 Expected Usable Bot Binary Strings
	13747	P11659 Triplet Ratio Queries
	13749	P11660 Island Village's Floor Function Queries
	13750	P11661 Counting Special Segments
	13751	P11662 Dynamic Grid Coloring
	13752	P11663 Bitaro's Monster Battle
	13753	P11664 Reachability in Company-Constructed DAG
	13754	P11665 Minimum k for a Successful Performance Show
	13755	P11666 Parcel Delivery Scheduling
	13756	P11667 Minimum Initial Stars
	13757	P11668 Counting Moo Subsequences
	13758	P11669 Reversal Operation Cow Checkup
	13760	P11670 Farm Reversal Inspection Sum
	13761	P11671 Modular Array Equalization
	13762	P11672 Lexicographically Smallest Addition Table Restoration
	13763	P11673 Approximate Median Modification
	13764	P11674 Dynamic Graph Connectivity with Extra Edge Additions
	13765	P11675 Avoiding the Cow Photography Lines
	13766	P11676 Minimum Cost for DFS Order
	13767	P11677 Bessie’s Shockwave Brick Breaking
	13768	P11678 Irrigation Optimization
	13769	P11679 Decapitated Carbon Creature
	13771	P11680 First, Middle, and Last Equal Numbers
	13772	P11681 No Unique Mode Replacement
	13773	P11682 Maximizing the Mode Frequency of Element-wise Modular Products
	13774	P11683 Collatz Conjecture Queries
	13775	P11684 GCD Gap Counting
	13776	P11685 Sum of Subexpression Evaluations
	13777	P11686 Beaver Happiness Minimization Problem
	13778	P11687 Circular Cake Cutting with Restrictions
	13780	P11690 Chess Moves on Tree
	13781	P11691 Half-Plane Intersection Sum Query
	13782	P11692 Cross Divine Name's Programs
	13783	P11693 Graph Game: Maximizing the Visited Node
	13784	P11694 Minimum Absolute Difference of GCD and LCM Partition
	13785	P11695 Interval Multiset Maintenance and Exact Cover Query
	13786	P11696 Maximizing Popcount Sum
	13787	P11697 Minimum Hops on a Rectangular Grid
	13788	P11698 Incomplete Prime
	13789	P11699 Assembling Venus Laboratory
	13791	P11700 Mineral Scanner
	13792	P11701 Counting Natural Number Pairs with a Given Square Difference
	13793	P11702 Maximum Imbalance Partition
	13794	P11703 OI Contest Score Sum
	13795	P11704 Interesting Round‐Trip Route
	13796	P11705 Isomorphic Substring Count
	13797	P11706 Crossing the Tunnel
	13798	P11707 Optimal City Shortcut
	13799	P11708 Grid Coloring with Yellow and Blue
	13800	P11709 Minimum Total Rotations to Open the Door
	13802	P11710 Maximize Valid Triplets
	13803	P11711 Train Shunting on a Tree
	13804	P11712 Ice Battle II: Minimum Record Deletions for Bipartite Teams
	13805	P11713 Magical Dragon's Expected Power
	13806	P11714 Counting Edge-Destroying Ways to Retain a Strongly Connected Digraph
	13807	P11715 Counting Valid Simple Cycles Through a Specific Grid Edge
	13808	P11716 Destroy the Spies: Camera Elimination
	13809	P11717 Matrix Replacement without Conflicts

Pick a problem randomly based on the current filter.