*2800 - Problem Set - 追梦算法网

	ID	Problem Show tags Hide tags	AC / Tried	Difficulty
	66	P1633F Perfect Matching data structures divide and conquer interactive trees *2800	0 / 0	(None)
	54	P1635F Closest Pair data structures greedy *2800	0 / 0	(None)
	7620	P1654F Minimal String Xoration bitmasks data structures divide and conquer greedy hashing sortings strings *2800	0 / 0	(None)
	7676	P1684G Euclid Guess constructive algorithms flows graph matchings math number theory *2800	0 / 0	(None)
	7671	P1685D1 Permutation Weight (Easy Version) constructive algorithms dfs and similar dsu *2800	0 / 0	(None)
	7750	P1693D Decinc Dividing brute force data structures divide and conquer dp greedy *2800	0 / 0	(None)
	7626	P1697F Too Many Constraints 2-sat constructive algorithms graphs implementation *2800	0 / 0	(None)
	7755	P1698F Equal Reversal constructive algorithms graphs implementation math *2800	0 / 0	(None)
	8033	P1732E Location data structures dp math number theory *2800	0 / 0	10
	7997	P1746F Kazaee data structures hashing probabilities *2800	0 / 0	10
	8160	P1765I Infinite Chess implementation shortest paths *2800	0 / 0	10
	8149	P1766F MCF flows *2800	0 / 0	10
	8094	P1773G Game of Questions bitmasks combinatorics dp fft math probabilities *2800	0 / 0	10
	8349	P1808E3 Minibuses on Venus (hard version) brute force combinatorics dp math *2800	0 / 0	10
	8318	P1809G Prediction combinatorics dp math *2800	0 / 0	10
	8343	P1810F M-tree data structures math trees *2800	0 / 0	10
	8387	P1819D Misha and Apples brute force data structures dp two pointers *2800	0 / 0	10
	8486	P1827D Two Centroids data structures dfs and similar greedy trees *2800	0 / 0	10
	8478	P1830D Mex Tree brute force dp trees *2800	0 / 0	10
	8543	P1842G Tenzing and Random Operations combinatorics dp math probabilities *2800	0 / 0	10

Pick a problem randomly based on the current filter.