Problem Set - OpenJudge

	ID	Problem
	52937	C8903 Product Except Self
	52938	C8904 Frog Jump Reachability
	52939	C8905 Maximum Task Assignment
	52940	C8906 Fully Connected Networks
	52941	C8907 Unique Word Checker
	52942	C8908 Find the Smallest Missing Positive Integer
	52943	C8909 Longest Valid Parentheses Substring
	52945	C8910 Maximum Color Codes in a Grid
	52946	C8911 Average at Even Indices
	52947	C8912 Special Palindrome String
	52948	C8913 Find the Highest Peak
	52949	C8914 Deranged Array Generation
	52950	C8915 Robot Success Rate Computation
	52951	C8916 Longest Fragments Sum
	52952	C8917 Equal Sum Three Partition
	52953	C8918 Scrambled String Determination
	52954	C8919 Merge the Tools
	52956	C8920 Next Greater Element
	52957	C8921 Office Space Optimization
	52958	C8922 Taco Game Winner Determination
	52959	C8923 Reachability on a Grid
	52960	C8924 Lexicographically Smallest String after Reversal
	52961	C8925 Unique Paths in a Matrix with Obstacles
	52962	C8926 Longest Consecutive Subsequence
	52963	C8927 Amazing String Transformation
	52964	C8928 Event Counter
	52965	C8929 Select K Non-Overlapping Events
	52967	C8930 Parking Lot Management
	52968	C8931 Subsets Sum Equals Target
	52969	C8932 Simple Text Editor
	52970	C8933 Forming Teams
	52971	C8934 Cycle Detection in Graphs
	52972	C8935 Sum of Primes in Ranges
	52973	C8936 Custom Binary Tree Inorder Traversal
	52974	C8937 Form a String with One Extra Letter
	52975	C8938 Maximum Overlapping Shifts
	52976	C8939 Optimal Meeting Point
	52978	C8940 Matrix Transformation Check
	52979	C8941 Traveling Salesman Problem
	52980	C8942 Zigzag Sequence Transformation
	52981	C8943 Toy Train Route
	52982	C8944 Minimum Moves to Equalize Towers
	52983	C8945 Incremental Submatrix Operation
	52984	C8946 Odd Even Level Difference in Binary Tree
	52985	C8947 Longest Anagram Substring
	52986	C8948 Taco Grid Maximum Coins
	52987	C8949 Min Stack Design
	52989	C8950 Longest Palindromic Substring Length
	52990	C8951 Drone Final Position
	52991	C8952 Counting Paths in a Grid
	52992	C8953 Magic Square Rearrangement
	52993	C8954 Remaining People in Queue
	52994	C8955 Zigzag String Checker
	52995	C8956 Magical Numbers
	52996	C8957 Find the Single Number
	52997	C8958 Magical Sequences
	52998	C8959 Count Palindromic Words
	53000	C8960 Minimum Token Difference
	53001	C8961 Minimum Removals to Sort Array
	53002	C8962 Minimum Maximum Difference Path
	53003	C8963 Planting Trees on a Grid
	53004	C8964 Reverse Vowels
	53005	C8965 Taco Path Counting Problem
	53006	C8966 Sort Books by Pages
	53007	C8967 Calculate Total Revenue
	53008	C8968 Tribonacci Sequence Generation
	53009	C8969 Partition Array into K Equal Sum Subsets
	53011	C8970 Taco - Minimum Travel Time
	53012	C8971 Sunlit Skyscrapers
	53013	C8972 Stabilizing Light Energy
	53014	C8973 Fuel Efficiency Evaluator
	53015	C8974 Maximum Aesthetic Value
	53016	C8975 Phone Keypad Conversion
	53017	C8976 Minimum Insertions for Palindrome
	53018	C8977 Minimum Road Connection Length
	53019	C8978 Anagram Finder
	53020	C8979 Sorted Squares
	53022	C8980 Maximum Subsequence Score
	53023	C8981 Count Distinct Words
	53024	C8982 Maximum Sum of Products
	53025	C8983 Most Popular Dish
	53026	C8984 Distinct Words Formation
	53027	C8985 Synonym Groups
	53028	C8986 Smallest Window Containing All Unique Characters
	53029	C8987 Next Journal ID Generator
	53030	C8988 Leaf Nodes Counting and Summing
	53031	C8989 Largest Square Tiling
	53033	C8990 Comparing Large Integers Represented as Strings
	53034	C8991 Maximum Non-overlapping Activities
	53035	C8992 Counting Distinct Rectangular Pairs
	53036	C8993 Largest Identical Square Subgrid
	53037	C8994 Product Except Self
	53038	C8995 Count Distinct Absolute Differences
	53039	C8996 Longest Subarray with K Distinct Integers
	53040	C8997 Jump Game
	53041	C8998 Longest Subarray with Bounded Difference
	53042	C8999 Can Split Rental Cost
	53046	C9000 Taco Navigator: Shortest Path in a City Grid
	53047	C9001 Final Drone Position
	53048	C9002 Minimum Initial Flowers for Full Bloom

Pick a problem randomly based on the current filter.