Problem Set - OpenJudge

	ID	Problem
	20002	P6795 Maximizing Contiguous Value Segments
	20003	P6796 Sum of Subexpression Values
	20004	P6797 Barbosa's Pacific Escape
	20005	P6798 Tree Weight Update and Subtree Maximum Sum Queries
	20006	P6799 Counting Independent Sets of Tree Paths
	20007	P6800 Evaluating a Polynomial at Exponential Points
	20008	P6801 Counting Fancy Rectangles in a Segmented Fence
	20009	P6802 Connecting Treeland
	20010	P6803 Interstellar Federation – Star Gate Arrangements
	20011	P6804 Minimizing Height Difference between Trusted Shamans
	20012	P6805 Spring Cleaning Tree
	20013	P6806 Chess World: Minimum Moves and Distinct Paths
	20014	P6807 Find the Maximum K with Increasing Paired Sequence
	20015	P6808 Maximizing Representable Sums
	20016	P6809 Matrix Reconstruction from Neighbour Counts
	20017	P6810 GCD Tau Summation Modulo
	20018	P6811 Distinct Subsequences in Repeated Colored Wool Sequence
	20019	P6812 Pioneer Sequence Query
	20020	P6813 Glass Tree Scoring
	20021	P6814 Circular Roulette Moves
	20022	P6815 Sum of Triangle Contributions in a Graph
	20023	P6816 Matching Substring Pattern
	20024	P6817 Maximal Congruent Subset Problem
	20025	P6818 Convex Hull Area Queries in a k x k Plane
	20026	P6819 Kth Losing Position in the Box Game
	20027	P6820 Two Permutations Writing
	20028	P6821 Maximum Sum of At Most k Non-Overlapping Subarrays
	20029	P6822 Minimum Cost Path in a Weighted Graph with Vertex Transition Cost
	20030	P6823 Sequence Operations Simulation
	20031	P6824 Maximizing Drank Coke Boxes
	20032	P6825 Summation of GCD Powers Modulo p
	20033	P6826 Charm of Falling Flowers
	20034	P6827 Maximum Value Parenthesis Subsequence Matching
	20035	P6828 Polynomial Evaluation at Power Sequences
	20036	P6829 Plant Height Comparisons
	20037	P6830 Bridges at Gardens by the Bay
	20038	P6831 Maximizing Carnival Game Rewards
	20039	P6832 Most Frequent Substring Count
	20040	P6833 Minimum Resistance Steiner Tree in a Grid
	20041	P6834 Expected Minimum Magic Uses
	20042	P6835 Expected Steps in a Retrograde Graph
	20043	P6836 Uniform Cookie Bag Distribution
	20044	P6837 Counting Type A Mushrooms
	20045	P6838 Routing in Singapore's Backbone Network
	20046	P6839 Robust Typewriter Challenge
	20047	P6840 Year 2012 Rescue Mission
	20048	P6841 Counting Readable Words
	20049	P6842 Folding Strip Length
	20050	P6843 Absolute File Path Length
	20051	P6844 Skyscraper Construction Order
	20052	P6845 Dynamic Tree Diameter
	20053	P6846 Edge Reorientation for Acyclic Graphs
	20054	P6847 Tree Harvesting Problem
	20055	P6848 Transforming a Polygon into an Equal‐Area Rectangle
	20056	P6849 Maximum Divine Power with Large Scallions and Drawers
	20057	P6850 Team Qualification
	20058	P6851 Maximizing Candy Count in a Card Chip Game
	20059	P6852 Restore the Permutation from MEX Constraints
	20060	P6853 Minimal Bus Route Planning
	20061	P6854 Beautiful Photo Segments
	20062	P6855 Minimizing the Maximum Path Score
	20063	P6856 Sum of Legal Subsequence Values
	20064	P6857 Amazing John's Dream Bridge Challenge
	20065	P6858 Amazing John and the Fat Head Fish Challenge
	20066	P6859 Amazing John's Flower Walk
	20067	P6860 Infinite Chessboard Knight Reachability
	20068	P6861 Maximum Sum of Bitwise OR and XOR
	20069	P6862 Sum of Degrees of a Node in Random Trees
	20070	P6863 Determining the Feasible Range for x₁ in a Quadratic Chain Equation
	20071	P6864 Dynamic Parentheses String Operations
	20072	P6865 Minimum Graph Coloring
	20073	P6866 Counting Rectangles in a Matrix
	20074	P6867 Criticism Chain
	20075	P6868 Non‐Intersecting Axis‐Aligned Pairing
	20076	P6869 Tree Ticket Optimization
	20077	P6870 Counting Happy Assignments
	20078	P6871 Counting Words with a Given Hash Value
	20079	P6872 Filename Pattern Matching
	20080	P6873 Maximum Number of Test Sentences
	20081	P6874 Brick Pile Construction
	20082	P6875 Counting Regions Formed by Non-Intersecting Circles on the x-axis
	20083	P6876 Safe Shortest Paths
	20084	P6877 Minimizing Maximum Discomfort
	20085	P6878 Minimizing Operation 3 in JOI String Transformation
	20086	P6879 Collecting Black and White Bear Statues
	20087	P6880 Minimize Cycle Cost with Single Edge Reversal
	20088	P6881 Sequence Propagation and Zeroing Query Cost
	20089	P6882 Count Names in Sentences
	20090	P6883 Optimal Water Transfer
	20091	P6884 Quality Arithmetic Expression Maximization
	20092	P6885 Maximal Longest Increasing Subsequence Count
	20093	P6886 Safe Fly Swatter Placement
	20094	P6887 Ticket Queue Reordering
	20095	P6888 Shortest Route Planning in a Grid City
	20096	P6889 Connect: Minimize Total Disjoint Path Length
	20097	P6890 K-Reachable Website
	20098	P6891 Monotonic Sequence Construction
	20099	P6892 Baggage Reordering
	20100	P6893 Buffet Lunch Optimization
	20101	P6894 Crane Stability

Pick a problem randomly based on the current filter.