Problem Set - OpenJudge

	ID	Problem
	50160	C6403 Longest Palindromic Substring
	50161	C6404 Longest Increasing Subsequence of Tree Heights
	50162	C6405 Subset Sum Puzzle
	50163	C6406 Taco Adventure: Reach the Treasure and Return
	50164	C6407 Reversing Substring Equality
	50165	C6408 Minimum Weight Difference Partition
	50166	C6409 List Operations and Maximum Query
	50168	C6410 Minimum Swaps to Match Dish Distribution
	50169	C6411 Count Inversions
	50170	C6412 Frog Teleportation
	50171	C6413 Largest Number Concatenation
	50172	C6414 Automated Fruit Vendor
	50173	C6415 Longest Subarray with Sum Constraint
	50174	C6416 Transform Points on a 2D Plane
	50175	C6417 Maximum Subarray Sum
	50176	C6418 Book Collection Queries
	50177	C6419 Shortest Path in a Grid
	50179	C6420 Purchase Records Validation
	50180	C6421 Remove Vowels from a String
	50181	C6422 Taco Time Slot Assignment
	50182	C6423 Modified Sum of Array Elements
	50183	C6424 Color Class Operations
	50184	C6425 Longest Feeding Sequence
	50185	C6426 King's Highway Connection
	50186	C6427 Folder Structure Storage Constraints
	50187	C6428 Diamond Pattern
	50188	C6429 Asteroid Destruction
	50190	C6430 Maximum Books in Series
	50191	C6431 Palindrome Checker
	50192	C6432 Remove Consecutive Duplicates
	50193	C6433 Longest Unique Substring Queries
	50194	C6434 Two Sum Problem
	50195	C6435 Maximum Product Subset
	50196	C6436 Prioritize Disaster Sites
	50197	C6437 Range Minimum Query with Updates
	50198	C6438 Find the Most Popular Class Package
	50199	C6439 Matrix Transposition and Validation
	50201	C6440 Library Book Borrowing System
	50202	C6441 Maximum Consecutive Knights Strength
	50203	C6442 Minimum Number of Aircraft Required
	50204	C6443 Longest Zigzag Subsequence
	50205	C6444 Maintain Unique Sample IDs
	50206	C6445 Rainfall Pattern Analysis
	50207	C6446 Minimum Path Sum in a Matrix
	50208	C6447 Extract Book Information
	50209	C6448 Sum of Primes' Last Four Digits
	50210	C6449 Minimum Steps to Reach Target
	50212	C6450 Matrix Transformations
	50213	C6451 Chemical Formula Parser
	50214	C6452 Team Division Challenge
	50215	C6453 Find the Missing Element
	50216	C6454 Longest Valid Path in a Letter Grid
	50217	C6455 Movie Collection Manager
	50218	C6456 LRU Cache Implementation
	50219	C6457 Employee Management Hierarchy
	50220	C6458 Unique Pair Sum Finder
	50221	C6459 Special Matrix Sum
	50223	C6460 Total Transfer Fees
	50224	C6461 Calculate Straight-Line Distance
	50225	C6462 Check Palindrome Number
	50226	C6463 Marble Probabilities
	50227	C6464 Largest Product of Three Numbers
	50228	C6465 Drone Package Delivery
	50229	C6466 Even Sum Pairs
	50230	C6467 Minimizing Absolute Differences
	50231	C6468 Smallest Contiguous Subarray Sum
	50232	C6469 Minimum Operations Reducer
	50234	C6470 Smallest Enclosing Rectangle for Rare Plants
	50235	C6471 Smallest Subarray with Divisible Element
	50236	C6472 Taco Task Queries
	50237	C6473 Two Sum in a Sorted Array
	50238	C6474 Minimum Subset Sum Difference
	50239	C6475 Rearrangement Sum Range Problem
	50240	C6476 Snack Packs for Friends
	50241	C6477 Maximum Non-overlapping Meetings
	50242	C6478 Calculate Final Score
	50243	C6479 Baking Feast
	50245	C6480 Transmission System Minimum Finder
	50246	C6481 Taco Fibonacci
	50247	C6482 Sort Books
	50248	C6483 Minimum Sticks to Form a Triangle
	50249	C6484 Longest Contiguous Even Subsequence
	50250	C6485 Taco's Discount Strategy
	50251	C6486 Planet Teleportation
	50252	C6487 Pair Sum Existence
	50253	C6488 Pair Sum Existence
	50254	C6489 Trap Rain Water
	50256	C6490 Sum of Acute Angles
	50257	C6491 Digit Summation Replacements
	50258	C6492 Matrix Addition and Formatting
	50259	C6493 Maximum Non-Overlapping Jobs
	50260	C6494 Drone Vertical Distance Optimization
	50261	C6495 Second Maximum Value
	50262	C6496 Matrix Transformation
	50263	C6497 Maximum Number of Visible Boxes
	50264	C6498 IPv4 Address Validator
	50265	C6499 Meeting Request Scheduling
	50268	C6500 Next Lexicographical Permutation
	50269	C6501 Minimum Insertions to Form a Palindrome
	50270	C6502 Three Sum Problem: Find Triplet with Sum K

Pick a problem randomly based on the current filter.