Problem Set - OpenJudge

	ID	Problem
	23102	P9958 Shell Game Scoring
	23103	P9959 Sleepy Cow Sorting
	23104	P9960 Guess the Animal
	23105	P9961 Minimum Block Exchange Sorting
	23106	P9962 Minimizing Tree Weight
	23107	P9963 Expected Prefix Sums in a Random Sequence
	23108	P9964 Symmetric Folding
	23109	P9965 Maximum Balls Transformation
	23110	P9966 Robot Circle Instruction Execution
	23111	P9967 Maximizing Mining Output in a Tree‐Structured Mine
	23112	P9968 Binary String Deletion Game
	23113	P9969 Divide and Conquer Multiplication Challenge
	23114	P9970 MEX Subarray Selection
	23115	P9971 Three-step Chess
	23116	P9972 Minimizing Ether Transmission Flow via Tower Destruction
	23117	P9973 Detecting ChatSAA Generated Sentences
	23118	P9974 Candy Bar Feeding Simulation
	23119	P9975 Minimum Initial Infection Count
	23120	P9976 Asparagus Growth Ordering
	23121	P9977 Balanced Cow Towers
	23122	P9978 Barn Numbering Alignment
	23123	P9979 Bessie’s Target Shooting
	23124	P9980 Counting Direct Flights
	23125	P9981 Longest Journey on Cow Land
	23126	P9982 Hay Delivery Waste Minimization
	23127	P9983 Cow Disease Propagation
	23128	P9984 Graph Expansion and Accumulation
	23129	P9985 Single‐Track Railway Scheduling
	23130	P9986 Count Ones in Binary Representation of Exponential Sum
	23131	P9987 Permutation Sequence Maintenance
	23132	P9988 Permutation Construction on Rooted Tree
	23133	P9989 GCD and Sum Queries
	23134	P9990 Odd Distinct Subintervals
	23135	P9991 Maximum Subinterval with Fewer Distinct Values
	23136	P9992 Counting Subtree Inclusion Sets
	23137	P9993 Historical Maximum Query
	23138	P9994 Plane Points Operations
	23139	P9995 Integer Sequence Operations and Distinct Count Query
	23140	P9996 Count Valid Point Pairs
	23141	P9997 Tree Path Character Operations
	23142	P9998 Sequence Transition Sum Queries
	23143	P9999 Stepwise Tree Navigation
	11981	P10000 Exact K-Step Shortest Path
	11982	P10001 Sequential Purchases with Coupon Rewards
	11983	P10002 Isomorphic Subtree Counting in Rooted Trees
	11984	P10003 Efficient Navigation on Moving Sidewalks
	11985	P10004 Permutation Ascents and Inverse Permutations
	11986	P10005 Summing Inverses of Prefix Sum Products
	11987	P10006 Counting k‐Super‐Real Numeral Strings on Tree Paths
	11988	P10007 Prefix Sum Transformation
	11989	P10008 Counting Distinct Interval Minimum Sequences
	11990	P10009 XOR Differencing Queries
	11992	P10010 Maximized Subset Product
	11993	P10011 Counting Maximum Flows in a Special Directed Grid Network
	11994	P10012 Bracket String Transformation and Query
	11995	P10013 Sum of Weighted Labels in Valid Tree Topological Orderings
	11996	P10014 Modified Nim Game
	11997	P10015 Rectangle Coloring Problem
	11998	P10016 Tree Rainbow Queries
	11999	P10017 Maximizing 0/1-Trie Nodes from Tree Paths
	12001	P10024 Lucky Number Range
	12002	P10025 Maximizing Manhattan Distance Sum in a Grid Cafeteria
	12003	P10026 Reachable Number Transformation
	12004	P10027 Counting Magical Grid Journeys
	12005	P10028 Prefix Reversal and Increasing Pairs Query
	12006	P10029 Alice and Bob's Game of Subtraction
	12008	P10030 Modular Operations Reachability
	12009	P10031 XOR of GCDs
	12010	P10032 Sequence Transformation by Global Mex Operations
	12011	P10033 Distinct Subarray Sum Avoidance
	12012	P10034 Deranged Cycle Construction
	12013	P10035 Staircase Painting
	12014	P10036 Casino Chip Winning Methods
	12015	P10037 White Pear Tree
	12016	P10038 Maximizing the Lock Paralysis Time
	12017	P10039 Tree Game
	12019	P10040 Counting Ones in Recursively Defined Binary Strings
	12020	P10041 Maximizing Net Profit by Selling Merged Slimes
	12021	P10042 Flower Palette Convergence
	12022	P10043 Minimum Insertions for Broadcastable Tensors
	12023	P10044 Minimum Cycle in a Directed Graph
	12024	P10045 Odd Sequence Operations
	12025	P10046 Maximum Hamiltonian Cycle in a Directed Graph
	12026	P10047 Palindrome Construction
	12027	P10048 Critical Edge in Complete Graph
	12028	P10049 Forbidden Number Counting
	12030	P10050 Alternating Heights Arrangement
	12031	P10051 Bus Stop Assignment Under Rain
	12032	P10052 Maximizing Slide Coverage in Dual-Class Scheduling
	12033	P10053 Counting Winning Lottery Tickets
	12034	P10054 Minimum Cost for Sufficient Communication
	12035	P10055 Twos and Threes
	12036	P10056 Maximizing the Water Volume in a Cup
	12037	P10057 Intersecting Axis-Parallel Segments
	12038	P10058 String Transformation Operations
	12039	P10059 Maximize Minimum Range of Contiguous Subsequences
	12041	P10060 Counting Key‐Assignment Configurations in a Tree
	12042	P10061 Matrix Operations and Rotations
	12043	P10062 Latin Square Completion
	12044	P10063 Counting Squareful Intervals

Pick a problem randomly based on the current filter.