*2600 - 题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1186	P1437F Emotional Fishermen combinatorics dp math two pointers *2600	0 / 0	(无)
	1185	P1437G Death DBMS data structures string suffix structures strings trees *2600	0 / 0	(无)
	1176	P1439B Graph Subset Problem constructive algorithms data structures graphs *2600	0 / 0	(无)
	1175	P1439C Greedy Shopping binary search data structures divide and conquer greedy implementation *2600	0 / 0	(无)
	1150	P1446D1 Frequency Problem (Easy Version) data structures greedy *2600	0 / 0	(无)
	1066	P1466G Song of the Sirens combinatorics divide and conquer hashing math string suffix structures strings *2600	0 / 0	(无)
	1039	P1469F Power Sockets binary search data structures greedy *2600	0 / 0	(无)
	953	P1486F Pairs of Paths combinatorics data structures dfs and similar dp trees *2600	0 / 0	(无)
	910	P1493E Enormous XOR bitmasks constructive algorithms greedy math strings two pointers *2600	0 / 0	(无)
	909	P1493F Enchanted Matrix bitmasks interactive number theory *2600	0 / 0	(无)
	899	P1495D BFS Trees combinatorics dfs and similar graphs math shortest paths trees *2600	0 / 0	(无)
	872	P1500C Matrix Sorting bitmasks brute force constructive algorithms greedy two pointers *2600	0 / 0	(无)
	863	P1503D Flip the Cards 2-sat constructive algorithms data structures greedy sortings two pointers *2600	0 / 0	(无)
	852	P1505G Encoded message special problem implementation 2600	0 / 0	(无)
	832	P1510B Button Lock flows graph matchings graphs *2600	0 / 0	(无)
	792	P1515F Phoenix and Earthquake constructive algorithms dfs and similar dsu graphs greedy trees *2600	0 / 0	(无)
	752	P1523E Crypto Lights combinatorics dp math probabilities *2600	0 / 0	(无)
	716	P1530F Bingo bitmasks combinatorics dp math probabilities *2600	0 / 0	(无)
	669	P1536F Omkar and Akmar chinese remainder theorem combinatorics constructive algorithms fft games geometry math meet-in-the-middle string suffix structures *2600	0 / 0	(无)
	649	P1539F Strange Array data structures greedy sortings *2600	0 / 0	(无)
	568	P1554E You dfs and similar dp math number theory *2600	0 / 0	(无)
	545	P1558D Top-Notch Insertions combinatorics data structures *2600	0 / 0	(无)
	513	P1566F Points Movement data structures dp greedy implementation sortings *2600	0 / 0	(无)
	500	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	(无)
	470	P1575E Eye-Pleasing City Park Tour data structures trees *2600	0 / 0	(无)
	438	P1580B Mathematics Curriculum brute force combinatorics dp trees *2600	0 / 0	(无)
	424	P1582G Kuzya and Homework data structures number theory *2600	0 / 0	(无)
	410	P1584F Strange LCS bitmasks dp graphs greedy strings *2600	0 / 0	(无)
	394	P1592F1 Alice and Recoloring 1 constructive algorithms greedy *2600	0 / 0	(无)
	370	P1599A Weights constructive algorithms greedy two pointers *2600	0 / 0	(无)
	361	P1599J Bob's Beautiful Array bitmasks brute force greedy *2600	0 / 0	(无)
	277	P1613F Tree Coloring combinatorics divide and conquer fft *2600	0 / 0	(无)
	271	P1614E Divan and a Cottage binary search data structures *2600	0 / 0	(无)
	70	P1651E Sum of Matchings brute force combinatorics constructive algorithms dfs and similar graph matchings greedy math *2600	0 / 0	(无)
	55	P1656F Parametric MST binary search constructive algorithms graphs greedy math sortings *2600	0 / 0	(无)
	46	P1657F Words on Tree 2-sat dfs and similar dsu graphs trees *2600	0 / 0	(无)
	26	P1661F Teleporters binary search greedy *2600	0 / 0	(无)
	7776	P1679F Formalism for Formalism bitmasks dp math *2600	0 / 0	(无)
	7770	P1680F Lenient Vertex Cover dfs and similar divide and conquer dsu graphs trees *2600	0 / 0	(无)
	7764	P1684F Diverse Segments data structures two pointers *2600	0 / 0	(无)
	7860	P1685C Bring Balance brute force constructive algorithms greedy *2600	0 / 0	(无)
	7931	P1696F Tree Recovery brute force constructive algorithms dfs and similar dsu graphs trees *2600	0 / 0	(无)
	7917	P1699E Three Days Grace data structures dp greedy math number theory two pointers *2600	0 / 0	(无)
	7795	P1700E Serega the Pirate brute force constructive algorithms divide and conquer *2600	0 / 0	(无)
	7794	P1700F Puzzle constructive algorithms dp greedy *2600	0 / 0	(无)
	7982	P1704F Colouring Game constructive algorithms dp games *2600	0 / 0	(无)
	8248	P1762E Tree Sum combinatorics math trees *2600	0 / 0	10
	8247	P1762F Good Pairs binary search data structures dp *2600	0 / 0	10
	8097	P1765C Card Guessing combinatorics dp probabilities *2600	0 / 0	10
	8093	P1765G Guess the String constructive algorithms interactive probabilities *2600	0 / 0	10
	8194	P1773D Dominoes combinatorics flows graph matchings greedy *2600	0 / 0	10
	8190	P1773H Hot and Cold binary search interactive *2600	0 / 0	10
	8336	P1844F1 Min Cost Permutation (Easy Version) brute force constructive algorithms greedy math *2600	0 / 0	10
	8305	P1848E Vika and Stone Skipping brute force implementation math number theory *2600	0 / 0	10
	8521	P1863F Divide, XOR, and Conquer bitmasks dp math *2600	0 / 0	10
	8522	P1863F Divide, XOR, and Conquer bitmasks dp math *2600	0 / 0	10
	8726	P1898F Vova Escapes the Matrix brute force dfs and similar divide and conquer shortest paths *2600	0 / 0	10
	8678	P1906B Button Pressing bitmasks constructive algorithms hashing *2600	0 / 0	10
	8894	P1957F1 Frequency Mismatch (Easy Version) binary search data structures divide and conquer hashing probabilities trees *2600	0 / 0	10
	8910	P1958H Composite Spells special problem dp 2600	0 / 0	10
	8951	P1975F Set bitmasks brute force combinatorics dfs and similar divide and conquer dp math *2600	0 / 0	10
	8938	P1977E Tensor constructive algorithms graphs interactive *2600	0 / 0	10
	9039	P1987F2 Interesting Problem (Hard Version) dp *2600	0 / 0	10
	9083	P1990E2 Catch the Mole(Hard Version) binary search data structures dfs and similar divide and conquer interactive trees *2600	0 / 0	10

根据当前过滤条件随机选择一道题