Problem Set - OpenJudge

	ID	Problem
	19802	P6591 Balanced Root in a Tree
	19803	P6592 Strictly Decreasing Walk in a Directed Graph
	19804	P6593 The Charming Number
	19805	P6594 Minimizing Children's Dissatisfaction Under Teacher Constraints
	19806	P6595 Snack Planning and Risk Evaluation
	19807	P6596 Counting Graphs with Constrained Bridges
	19808	P6597 Counting Structural Isomers of Alkenes
	19809	P6598 Counting Alkane Isomers
	19810	P6599 Maximum XOR Sum Sequence
	19811	P6600 Count Valid T Shapes in a Binary Matrix
	19812	P6601 Gravity Machine Synchronization
	19813	P6602 Maximum Segment Length with Marker Constraints
	19814	P6603 Maximum Happiness in Dreamscapes
	19815	P6604 Sum of Subarray Minimums for Queries
	19816	P6606 Lexicographically Smallest Path Concatenation
	19817	P6607 Ants on a Rope
	19818	P6608 Mystical Sequence Dream
	19819	P6610 Naive Quadratic Congruence Equation
	19820	P6611 Counting Six-Ring Structures
	19821	P6612 Optimal Strategy in a Turn-based Game
	19822	P6613 Coefficient Extraction in a Differential Polynomial Equation
	19823	P6614 Dividing Points by a Linear Function
	19824	P6615 Maximize Tree Path Score
	19825	P6616 Minimal Moves to Dismantle n-Chain Puzzle
	19826	P6617 Garbage Bins Query
	19827	P6618 Maximum Treasure Collection on a Cactus Archipelago
	19828	P6619 Optimal Battlefield Temperature
	19829	P6620 Modular Polynomial Combinatorics
	19830	P6621 Magical Pricing Adjustment
	19831	P6622 Minimized Signal Transmission Time
	19832	P6623 Tree Subtree XOR Value Sum
	19833	P6624 Sum of Spanning Tree Values
	19834	P6625 Card Game Score Maximization
	19835	P6626 Message Propagation in a Tree Social Network
	19836	P6627 Mall Discount Promotion
	19837	P6628 Lilac Tour on the Campus
	19838	P6629 Distinct Elegant Substrings
	19839	P6630 Expected Marked Leaves in a Randomized Lazy Propagation Segment Tree
	19840	P6631 Sequence Reduction
	19841	P6632 Coloring Game with Bonus Rounds
	19842	P6633 Expected Card Drawing Rounds
	19843	P6634 Recovering the Secret Key
	19844	P6635 Directed Graph Orientation with k-th Lexicographical Topological Order
	19845	P6636 Genetic Mating and Subsequence Averaging
	19846	P6638 Routine Execution Count
	19847	P6639 Alice and Bob Stone Game
	19848	P6640 Longest Common Substring Queries
	19849	P6641 Counting Positions within Fields of View
	19850	P6642 Minimum Adjacent Swaps to Meet Deadlines
	19851	P6643 Minimizing Traversal Cost in a Weighted Graph
	19852	P6644 Constrained Color‐Switching Hamiltonian Path
	19853	P6645 Altina's Interval Collection
	19854	P6646 K Cheapest Purchase Strategies
	19855	P6647 Maximizing Sightseeing Score
	19856	P6648 Sum of Maximum Values in Subtriangles
	19857	P6649 Grid Game with Restricted Moves
	19858	P6650 Maximum Divisor Sum from Prime Power Partition
	19859	P6651 Counting Original Chains in a DAG after Vertex Removal
	19860	P6652 Minimum Operations to Transform String t to s
	19861	P6653 Grafting Tree Species
	19862	P6654 Distinct Rounding Sequences
	19863	P6655 Summing High Ground Counts in Uncertain Tree Structures
	19864	P6656 Find All Runs in a String
	19865	P6657 Non-Intersecting Lattice Paths on an n×n Chessboard
	19866	P6658 Maximal Edge 3-Connected Components
	19867	P6659 Least Common Multiple Interval
	19868	P6660 Determine the Source Book
	19869	P6661 Maximize Modified A for Losing Game
	19870	P6662 Toy Distribution for Children
	19871	P6663 Circuit Board Wiring Problem
	19872	P6664 The Warmest Path
	19873	P6665 Alice and Bob Game on Rooted Trees
	19874	P6666 Maximum Delayed Requests Importance in a Tree Network
	19875	P6667 Polynomial Transformation
	19876	P6668 Counting Connected Subtrees with Specified Color Counts
	19877	P6669 Combinatorial Divisibility
	19878	P6670 Soda Travel Optimization
	19879	P6671 Shortest Orienteering Path
	19880	P6672 Victory Deck Order Count
	19881	P6673 Rock‐Paper‐Scissors Tournament
	19882	P6674 Maximum Total Score in a Card Game
	19883	P6675 Worst Rank Possibility
	19884	P6676 Lexicographically Small Puzzle Arrangement
	19885	P6677 Colored Polygon Triangulation Quality
	19886	P6678 Bit Count in MalnarScript
	19887	P6679 Polygon Coloring Challenge
	19888	P6680 Graph Edge Completion
	19889	P6681 String Concatenation Ambiguity
	19890	P6682 Determine the Hair Dye Threshold
	19891	P6683 Mixing Spices to Match a Secret Ratio
	19892	P6684 Odd Cycle in Gotham
	19893	P6685 Count Positive Integers Satisfying \(x^m \le n\)
	19894	P6686 Counting Isosceles Triangles from Sticks
	19895	P6687 180° Rotation on a 2×n Grid
	19896	P6688 Range Essence Equality Query
	19897	P6689 Expected Longest Valid Parentheses Subsequence
	19898	P6690 Minimum Selection for Target Linear Function in Formal Power Series
	19899	P6691 Consistent Multiple Choice Puzzle
	19900	P6692 Sum of Manhattan Distances on a Grid with Obstacles
	19901	P6693 Summing Grassiness over Valid Segmentations

Pick a problem randomly based on the current filter.