Problem Set - HydroOJ

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	7102	P1A Theatre Square math *1000	48 / 130	3
	7101	P1B Spreadsheets implementation math *1600	11 / 30	5
	7100	P1C Ancient Berland Circus geometry math *2100	3 / 9	7
	7099	P2A Winner hashing implementation *1500	11 / 41	5
	7098	P2B The least round way dp math *2000	4 / 9	7
	7097	P2C Commentator problem geometry *2600	1 / 2	10
	7096	P3A Shortest path of the king greedy shortest paths *1000	6 / 19	3
	7095	P3B Lorry greedy sortings *1900	2 / 5	6
	7094	P3C Tic-tac-toe brute force games implementation *1800	4 / 5	6
	7093	P3D Least Cost Bracket Sequence greedy *2600	1 / 3	10
	7092	P4A Watermelon brute force math *800	18 / 53	3
	7091	P4B Before an Exam constructive algorithms greedy *1200	1 / 2	4
	7090	P4C Registration system data structures hashing implementation *1300	1 / 2	4
	7089	P4D Mysterious Present dp sortings *1700	3 / 4	5
	7088	P5A Chat Server's Outgoing Traffic implementation *1000	3 / 6	3
	7087	P5B Center Alignment implementation strings *1200	0 / 0	4
	7086	P5C Longest Regular Bracket Sequence constructive algorithms data structures dp greedy sortings strings *1900	2 / 3	6
	7085	P5D Follow Traffic Rules implementation math *2100	1 / 1	7
	7084	P5E Bindian Signalizing data structures *2400	0 / 0	9
	7083	P6A Triangle brute force geometry *900	6 / 8	3
	7082	P6B President's Office implementation *1100	0 / 0	3
	7081	P6C Alice, Bob and Chocolate greedy two pointers *1200	0 / 0	4
	7080	P6D Lizards and Basements 2 brute force dp *2600	0 / 0	10
	7079	P6E Exposition binary search data structures dsu trees two pointers *1900	1 / 7	6
	7078	P7A Kalevitch and Chess brute force constructive algorithms *1100	0 / 0	3
	7077	P7B Memory Manager implementation *1600	0 / 0	5
	7076	P7C Line math number theory *1800	1 / 2	6
	7075	P7D Palindrome Degree hashing strings *2200	0 / 2	8
	7074	P7E Defining Macros dp expression parsing implementation *2600	0 / 1	10
	7073	P8A Train and Peter strings *1200	1 / 1	4
	7072	P8B Obsession with Robots constructive algorithms graphs implementation *1400	1 / 2	4
	7071	P8C Looking for Order bitmasks dp *2000	1 / 2	7
	7070	P8D Two Friends binary search geometry *2600	0 / 0	10
	7069	P8E Beads dp graphs *2600	0 / 0	10
	7068	P9A Die Roll math probabilities *800	8 / 14	3
	7067	P9B Running Student brute force geometry implementation *1200	0 / 0	4
	7066	P9C Hexadecimal's Numbers brute force implementation math *1200	0 / 0	4
	7065	P9D How many trees? combinatorics divide and conquer dp *1900	1 / 1	6
	7064	P9E Interesting Graph and Apples dfs and similar dsu graphs *2300	0 / 0	8
	7063	P10A Power Consumption Calculation implementation *900	2 / 2	3
	7062	P10B Cinema Cashier dp implementation *1500	1 / 1	5
	7061	P10C Digital Root number theory *2000	0 / 0	7
	7060	P10D LCIS dp *2800	3 / 4	10
	7059	P10E Greedy Change constructive algorithms *2600	0 / 2	10
	7058	P11A Increasing Sequence constructive algorithms implementation math *900	3 / 4	3
	7057	P11B Jumping Jack math *1600	2 / 5	5
	7056	P11C How Many Squares? implementation *2200	0 / 0	8
	7055	P11D A Simple Task bitmasks dp graphs *2200	1 / 5	8
	7054	P11E Forward, march! binary search dp greedy *2800	1 / 1	10
	7053	P12A Super Agent implementation *800	5 / 10	3

Pick a problem randomly based on the current filter.