Problem Set - 南阳理工学院OJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	7431	P1A Theatre Square math *1000	1 / 2	10
	7430	P1B Spreadsheets implementation math *1600	0 / 0	(None)
	7429	P1C Ancient Berland Circus geometry math *2100	0 / 0	(None)
	7428	P2A Winner hashing implementation *1500	0 / 0	(None)
	7427	P2B The least round way dp math *2000	0 / 0	(None)
	7426	P2C Commentator problem geometry *2600	0 / 0	(None)
	7425	P3A Shortest path of the king greedy shortest paths *1000	0 / 0	(None)
	7424	P3B Lorry greedy sortings *1900	0 / 0	(None)
	7423	P3C Tic-tac-toe brute force games implementation *1800	0 / 0	(None)
	7422	P3D Least Cost Bracket Sequence greedy *2600	0 / 0	(None)
	7421	P4A Watermelon brute force math *800	0 / 0	(None)
	7420	P4B Before an Exam constructive algorithms greedy *1200	0 / 0	(None)
	7419	P4C Registration system data structures hashing implementation *1300	0 / 0	(None)
	7418	P4D Mysterious Present dp sortings *1700	0 / 0	(None)
	7417	P5A Chat Server's Outgoing Traffic implementation *1000	0 / 0	(None)
	7416	P5B Center Alignment implementation strings *1200	0 / 0	(None)
	7415	P5C Longest Regular Bracket Sequence constructive algorithms data structures dp greedy sortings strings *1900	0 / 0	(None)
	7414	P5D Follow Traffic Rules implementation math *2100	0 / 0	(None)
	7413	P5E Bindian Signalizing data structures *2400	0 / 0	(None)
	7412	P6A Triangle brute force geometry *900	0 / 0	(None)
	7411	P6B President's Office implementation *1100	0 / 0	(None)
	7410	P6C Alice, Bob and Chocolate greedy two pointers *1200	0 / 0	(None)
	7409	P6D Lizards and Basements 2 brute force dp *2600	0 / 0	(None)
	7408	P6E Exposition binary search data structures dsu trees two pointers *1900	0 / 0	(None)
	7407	P7A Kalevitch and Chess brute force constructive algorithms *1100	0 / 0	(None)
	7406	P7B Memory Manager implementation *1600	0 / 0	(None)
	7405	P7C Line math number theory *1800	0 / 0	(None)
	7404	P7D Palindrome Degree hashing strings *2200	0 / 0	(None)
	7403	P7E Defining Macros dp expression parsing implementation *2600	0 / 0	(None)
	7402	P8A Train and Peter strings *1200	0 / 0	(None)
	7401	P8B Obsession with Robots constructive algorithms graphs implementation *1400	0 / 0	(None)
	7400	P8C Looking for Order bitmasks dp *2000	0 / 0	(None)
	7399	P8D Two Friends binary search geometry *2600	0 / 0	(None)
	7398	P8E Beads dp graphs *2600	0 / 0	(None)
	7397	P9A Die Roll math probabilities *800	0 / 0	(None)
	7396	P9B Running Student brute force geometry implementation *1200	0 / 0	(None)
	7395	P9C Hexadecimal's Numbers brute force implementation math *1200	0 / 0	(None)
	7394	P9D How many trees? combinatorics divide and conquer dp *1900	0 / 0	(None)
	7393	P9E Interesting Graph and Apples dfs and similar dsu graphs *2300	0 / 0	(None)
	7392	P10A Power Consumption Calculation implementation *900	0 / 0	(None)
	7391	P10B Cinema Cashier dp implementation *1500	0 / 0	(None)
	7390	P10C Digital Root number theory *2000	0 / 0	(None)
	7389	P10D LCIS dp *2800	0 / 0	(None)
	7388	P10E Greedy Change constructive algorithms *2600	0 / 0	(None)
	7387	P11A Increasing Sequence constructive algorithms implementation math *900	0 / 0	(None)
	7386	P11B Jumping Jack math *1600	0 / 0	(None)
	7385	P11C How Many Squares? implementation *2200	0 / 0	(None)
	7384	P11D A Simple Task bitmasks dp graphs *2200	0 / 0	(None)
	7383	P11E Forward, march! binary search dp greedy *2800	0 / 0	(None)
	7382	P12A Super Agent implementation *800	0 / 0	(None)

Pick a problem randomly based on the current filter.