*2200 - Problem Set - 追梦算法网

ID	Problem Show tags Hide tags	AC / Tried	Difficulty
7572	P7D Palindrome Degree hashing strings *2200	0 / 0	(None)
7553	P11C How Many Squares? implementation *2200	0 / 0	(None)
7552	P11D A Simple Task bitmasks dp graphs *2200	0 / 0	(None)
7543	P13C Sequence dp sortings *2200	0 / 0	(None)
7513	P19C Deletion of Repeats greedy hashing string suffix structures *2200	0 / 0	(None)
7484	P25E Test hashing strings *2200	0 / 0	(None)
7475	P27D Ring Road 2 2-sat dfs and similar dsu graphs *2200	0 / 0	(None)
7471	P28C Bath Queue combinatorics dp probabilities *2200	0 / 0	(None)
7431	P36C Bowls geometry implementation *2200	0 / 0	(None)
7392	P42C Safe cracking brute force constructive algorithms *2200	0 / 0	(None)
7373	P45B School dp dsu *2200	0 / 0	(None)
7368	P45G Prime Problem number theory *2200	0 / 0	(None)
7354	P47D Safe brute force *2200	0 / 0	(None)
7353	P47E Cannon data structures geometry sortings *2200	0 / 0	(None)
7331	P51D Geometrical problem implementation *2200	0 / 0	(None)
7326	P52C Circular RMQ data structures *2200	0 / 0	(None)
7306	P56E Domino Principle binary search data structures sortings *2200	0 / 0	(None)
7264	P64G Path Canonization special problem 2200	0 / 0	(None)
7258	P65D Harry Potter and the Sorting Hat brute force dfs and similar hashing *2200	0 / 0	(None)
7244	P68C Synchrophasotron brute force *2200	0 / 0	(None)

Pick a problem randomly based on the current filter.

Categories