*2000 - 题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1930	P1294F Three Paths on a Tree dfs and similar dp greedy trees *2000	0 / 0	(无)
	1918	P1296E2 String Coloring (hard version) data structures dp *2000	0 / 0	(无)
	1897	P1301D Time to Run constructive algorithms graphs implementation *2000	0 / 0	(无)
	1873	P1304E 1-Trees and Queries data structures dfs and similar shortest paths trees *2000	0 / 0	(无)
	1846	P1311D Three Integers brute force math *2000	0 / 0	(无)
	1824	P1316D Nash Matrix constructive algorithms dfs and similar graphs implementation *2000	0 / 0	(无)
	1819	P1320C World of Darkraft: Battle for Azathoth brute force data structures sortings *2000	0 / 0	(无)
	1692	P1344B Monopole Magnets constructive algorithms dfs and similar dsu graphs *2000	0 / 0	(无)
	1680	P1346F Dune II: Battle For Arrakis special problem data structures greedy math 2000	0 / 0	(无)
	1669	P1349B Orac and Medians constructive algorithms greedy math *2000	0 / 0	(无)
	1668	P1349C Orac and Game of Life dfs and similar graphs implementation shortest paths *2000	0 / 0	(无)
	1642	P1354C2 Not So Simple Polygon Embedding binary search brute force geometry math *2000	0 / 0	(无)
	1594	P1359D Yet Another Yet Another Task data structures dp implementation two pointers *2000	0 / 0	(无)
	1593	P1359E Modular Stability combinatorics math number theory *2000	0 / 0	(无)
	1570	P1363E Tree Shuffling dfs and similar dp greedy trees *2000	0 / 0	(无)
	1553	P1366D Two Divisors constructive algorithms math number theory *2000	0 / 0	(无)
	1524	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	(无)
	1482	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(无)
	1474	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	(无)
	1449	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	(无)
	1436	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	(无)
	1424	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	(无)
	1381	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	(无)
	1339	P1408D Searchlights binary search brute force data structures dp implementation sortings two pointers *2000	0 / 0	(无)
	1311	P1415D XOR-gun bitmasks brute force constructive algorithms *2000	0 / 0	(无)
	1307	P1416B Make Them Equal constructive algorithms greedy math *2000	0 / 0	(无)
	1306	P1416C XOR Inverse bitmasks data structures divide and conquer dp greedy math sortings strings trees *2000	0 / 0	(无)
	1240	P1426F Number of Subsequences combinatorics dp strings *2000	0 / 0	(无)
	1237	P1427C The Hard Work of Paparazzi dp *2000	0 / 0	(无)
	1236	P1427D Unshuffling a Deck constructive algorithms implementation *2000	0 / 0	(无)
	1211	P1431E Chess Match special problem 2000	0 / 0	(无)
	1182	P1438C Engineer Artem 2-sat chinese remainder theorem constructive algorithms fft flows *2000	0 / 0	(无)
	1130	P1451E1 Bitwise Queries (Easy Version) bitmasks constructive algorithms interactive math *2000	0 / 0	(无)
	1110	P1454E Number of Simple Paths combinatorics dfs and similar graphs trees *2000	0 / 0	(无)
	1099	P1458B Glass Half Spilled dp *2000	0 / 0	(无)
	976	P1481D AB Graph brute force constructive algorithms graphs greedy implementation *2000	0 / 0	(无)
	948	P1487E Cheap Dinner brute force data structures graphs greedy implementation sortings two pointers *2000	0 / 0	(无)
	912	P1493C K-beautiful Strings binary search brute force constructive algorithms greedy strings *2000	0 / 0	(无)
	844	P1506F Triangular Paths constructive algorithms graphs math shortest paths sortings *2000	0 / 0	(无)
	843	P1506G Maximize the Remaining String brute force data structures dp greedy strings *2000	0 / 0	(无)
	805	P1513D GCD and MST constructive algorithms dsu graphs greedy number theory sortings *2000	0 / 0	(无)
	799	P1514D Cut and Stick binary search data structures greedy implementation sortings *2000	0 / 0	(无)
	759	P1521C Nastia and a Hidden Permutation constructive algorithms interactive *2000	0 / 0	(无)
	746	P1525C Robot Collisions data structures greedy implementation sortings *2000	0 / 0	(无)
	671	P1536D Omkar and Medians data structures greedy implementation *2000	0 / 0	(无)
	592	P1551E Fixed Points binary search brute force dp *2000	0 / 0	(无)
	546	P1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	(无)
	514	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	(无)
	507	P1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	(无)
	493	P1571F Kotlinforces special problem constructive algorithms dp 2000	0 / 0	(无)
	477	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	(无)
	427	P1582E Pchelyonok and Segments binary search data structures dp greedy math *2000	0 / 0	(无)
	412	P1584D Guess the Permutation binary search combinatorics interactive math *2000	0 / 0	(无)
	368	P1599C Bubble Strike combinatorics math probabilities ternary search *2000	0 / 0	(无)
	303	P1610D Not Quite Lee combinatorics dp math number theory *2000	0 / 0	(无)
	285	P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	(无)
	278	P1613E Crazy Robot dfs and similar graphs *2000	0 / 0	(无)
	259	P1616D Keep the Average High dp greedy math *2000	0 / 0	(无)
	243	P1618F Reverse bitmasks constructive algorithms dfs and similar implementation math strings *2000	0 / 0	(无)
	236	P1619F Let's Play the Hat? brute force constructive algorithms greedy math *2000	0 / 0	(无)
	235	P1619G Unusual Minesweeper binary search dfs and similar dsu greedy sortings *2000	0 / 0	(无)
	230	P1620D Exact Change brute force constructive algorithms greedy *2000	0 / 0	(无)
	214	P1622D Shuffle combinatorics math two pointers *2000	0 / 0	(无)
	202	P1624E Masha-forgetful brute force constructive algorithms dp hashing implementation strings *2000	0 / 0	(无)
	201	P1624F Interacdive Problem binary search constructive algorithms interactive *2000	0 / 0	(无)
	161	P1632D New Year Concert binary search data structures greedy math number theory two pointers *2000	0 / 0	(无)
	149	P1634D Finding Zero constructive algorithms interactive math *2000	0 / 0	(无)
	129	P1638D Big Brush constructive algorithms data structures greedy implementation *2000	0 / 0	(无)
	114	P1641B Repetitions Decoding constructive algorithms implementation sortings *2000	0 / 0	(无)
	98	P1646D Weight the Tree constructive algorithms dfs and similar dp implementation trees *2000	0 / 0	(无)
	48	P1657D For Gamers binary search brute force greedy math sortings *2000	0 / 0	(无)
	14	P1665D GCD Guess bitmasks chinese remainder theorem constructive algorithms games interactive math number theory *2000	0 / 0	(无)
	7736	P1672F1 Array Shuffling constructive algorithms graphs greedy *2000	0 / 0	(无)
	7721	P1674E Breaking the Wall binary search brute force constructive algorithms greedy math *2000	0 / 0	(无)
	7719	P1674G Remove Directed Edges dfs and similar dp graphs *2000	0 / 0	(无)
	7771	P1680E Moving Chips bitmasks dp greedy *2000	0 / 0	(无)
	7861	P1685B Linguistics greedy implementation sortings strings *2000	0 / 0	(无)
	7834	P1690G Count the Trains binary search data structures greedy sortings *2000	0 / 0	(无)
	7932	P1696E Placing Jinas combinatorics math *2000	0 / 0	(无)
	7903	P1702G2 Passable Paths (hard version) data structures dfs and similar trees *2000	0 / 0	(无)
	7975	P1712D Empty Graph binary search constructive algorithms data structures greedy shortest paths *2000	0 / 0	(无)
	7956	P1716C Robot in a Hallway data structures dp greedy implementation ternary search *2000	0 / 0	(无)
	7955	P1716D Chip Move brute force dp math *2000	0 / 0	(无)
	8033	P1725C Circular Mirror binary search combinatorics geometry math two pointers *2000	0 / 0	(无)
	8018	P1726D Edge Split brute force constructive algorithms dfs and similar dsu graphs probabilities trees *2000	0 / 0	(无)
	8180	P1744F MEX vs MED math two pointers *2000	0 / 0	7
	8143	P1753C Wish I Knew How to Sort dp math probabilities *2000	0 / 0	7
	8243	P1763C Another Array Problem brute force constructive algorithms greedy *2000	0 / 0	7
	8106	P1764D Doremy's Pegging Game combinatorics dp math *2000	0 / 0	7
	8208	P1772F Copy of a Copy of a Copy constructive algorithms dfs and similar graphs implementation sortings *2000	0 / 0	7
	8372	P1841D Pairs of Segments data structures greedy sortings two pointers *2000	0 / 0	7
	8530	P1862G The Great Equalizer binary search data structures math sortings *2000	0 / 0	7
	8531	P1862G The Great Equalizer binary search data structures math sortings *2000	0 / 0	7
	8477	P1867E1 Salyg1n and Array (simple version) constructive algorithms interactive math *2000	0 / 0	7
	8478	P1867E1 Salyg1n and Array (simple version) constructive algorithms interactive math *2000	0 / 0	7
	8442	P1872G Replace With Product brute force greedy math *2000	0 / 0	7
	8714	P1900D Small GCD bitmasks brute force dp math number theory *2000	0 / 0	7
	8694	P1903E Geo Game greedy interactive math *2000	0 / 0	7
	8674	P1906F Maximize The Value data structures sortings *2000	0 / 0	7
	8654	P1910F Build Railway Stations special problem greedy trees 2000	0 / 0	7

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