Problem Set - OpenJudge

	ID	Problem
	45272	C2003 Maximum Root-to-Leaf Sum in a Binary Tree
	45273	C2004 Count Visible People
	45274	C2005 Sum of Adjacent Elements
	45275	C2006 Fibonacci Number Computation
	45276	C2007 Smallest Palindrome Extension
	45277	C2008 Second Largest Unique Element
	45278	C2009 Gridland Traffic Lights
	45280	C2010 Grid Paths with Obstacles
	45281	C2011 Check Odd Sum Subarray
	45282	C2012 Longest Increasing Subsequence
	45283	C2013 Pair with Given Sum
	45284	C2014 Taco Maximum Path Sum
	45285	C2015 Harmonious Sequence
	45286	C2016 Maximum Card Value Query
	45287	C2017 Maximum Non-Decreasing Days
	45288	C2018 Critical Oxygen Level Detection
	45289	C2019 Can Chef Follow the Recipe?
	45291	C2020 Highest Average Student
	45292	C2021 Taco Transformation Game
	45293	C2022 Calculate Total Bonus
	45294	C2023 Maximum Travelers
	45295	C2024 Minimum Movements to Start
	45296	C2025 Parrot Repeats
	45297	C2026 The Bravest Knight
	45298	C2027 Longest Working Days
	45299	C2028 Minimum Coins Change Problem
	45300	C2029 Expense Report Checker
	45302	C2030 Clip Sequence Excluding Banned Words
	45303	C2031 Alphanumeric Password Probability
	45304	C2032 Maximum Attractions
	45305	C2033 Find Two Unique Numbers
	45306	C2034 Filter Long Words
	45307	C2035 Longest Zigzag Subsequence
	45308	C2036 Minimum Swaps to Sort
	45309	C2037 Group Even and Odd Numbers
	45310	C2038 Taco Service Quality Classification
	45311	C2039 Counting Distinct Paths in a Grid with Obstacles
	45313	C2040 Checkpoint Product Indices
	45314	C2041 Taco's Fish Feeding Observation
	45315	C2042 Largest Rectangle in a Histogram
	45316	C2043 Minimum Color Changes
	45317	C2044 Largest Gap
	45318	C2045 Lexicographic Order Checker with Custom Alphabet
	45319	C2046 Enhanced Number Value
	45320	C2047 Find Pairs with Target Sum
	45321	C2048 Fish Population Growth
	45322	C2049 Task Queue Processing
	45324	C2050 Count Strictly Increasing Triplets
	45325	C2051 Maximize Mood Difference
	45326	C2052 Longest Non-Repeating Color Pattern
	45327	C2053 Waste Distribution Problem
	45328	C2054 Kaprekar Number Checker
	45329	C2055 Concatenated Palindrome Check
	45330	C2056 Large File Finder
	45331	C2057 Equal Subset Sum Partition
	45332	C2058 City Construction
	45333	C2059 Crystal Merging: Minimizing Total Cost
	45335	C2060 Two Sum
	45336	C2061 Word Search on 2D Board
	45337	C2062 Optimal Well Location
	45338	C2063 Minimum Moves to Non-decreasing Array
	45339	C2064 Calculate Order Calories
	45340	C2065 Minimum Cell Changes to Ensure Ones
	45341	C2066 Two Sum Problem
	45342	C2067 Longest Common Subsequence
	45343	C2068 Sum of Submatrix Elements
	45344	C2069 Counting Merged Sections
	45346	C2070 Diagonal Matrix Generator
	45347	C2071 Shortest Path in a Grid
	45348	C2072 Replace and Count
	45349	C2073 Distinct Subsequences
	45350	C2074 Longest Straight Line Path in a Grid
	45351	C2075 Smallest Permutation with One Swap
	45352	C2076 Maximum Utility
	45353	C2077 Minimum Follows Propagation
	45354	C2078 Maximum Points in Levels
	45355	C2079 Extract and Sort Distinct Words
	45357	C2080 Network Connectivity Check
	45358	C2081 Longest Palindromic Subsequence
	45359	C2082 Largest Arithmetic Subsequence
	45360	C2083 Active Users Query with Timestamps
	45361	C2084 Find Unique Pairs with Given Sum
	45362	C2085 Minimum Exercises to Reach Target Benefit Score
	45363	C2086 Minimize Maximum Subarray Sum Partition
	45364	C2087 Decode Encoded String
	45365	C2088 Maximum Simultaneous Data Transfer Sessions
	45366	C2089 String Transformation Instructions
	45368	C2090 Depth of the Root
	45369	C2091 Minimum Moves to Equal Array Elements
	45370	C2092 Longest Common Subsequence Length
	45371	C2093 Highest Combined Price
	45372	C2094 Merge Fish Parties
	45373	C2095 Rearrange to Palindrome
	45374	C2096 Arrange Odd and Even Nodes in a Linked List
	45375	C2097 Lexicographical Power Set
	45376	C2098 String Segmentation using Dictionary Words
	45377	C2099 Valid Plus Sign in Grid
	45380	C2100 Make Every K Length Palindrome
	45381	C2101 Magic Tree Maximum Path Sum
	45382	C2102 Count Character Occurrences

Pick a problem randomly based on the current filter.