题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	8156	P1749E Cactus Wall constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	9
	8155	P1749F Distance to the Path data structures dfs and similar trees *2800	0 / 0	10
	8154	P1750A Indirect Sort constructive algorithms implementation math *800	0 / 0	3
	8153	P1750B Maximum Substring brute force greedy implementation *800	0 / 0	3
	8152	P1750C Complementary XOR constructive algorithms implementation *1400	0 / 0	4
	8151	P1750D Count GCD combinatorics math number theory *1800	0 / 0	6
	8150	P1750E Bracket Cost binary search data structures divide and conquer dp greedy strings *2400	0 / 0	9
	8149	P1750F Majority combinatorics dp math strings *2700	0 / 0	10
	8148	P1750G Doping combinatorics dp math *3300	0 / 0	10
	8147	P1750H BinaryStringForces constructive algorithms data structures dp *3500	0 / 0	10
	8146	P1753A1 Make Nonzero Sum (easy version) constructive algorithms dp greedy *1300	0 / 0	4
	8145	P1753A2 Make Nonzero Sum (hard version) constructive algorithms dp greedy *1500	0 / 0	5
	8144	P1753B Factorial Divisibility math number theory *1600	0 / 0	5
	8143	P1753C Wish I Knew How to Sort dp math probabilities *2000	0 / 0	7
	8142	P1753D The Beach constructive algorithms dfs and similar graphs shortest paths *2400	0 / 0	9
	8141	P1753E N Machines binary search brute force greedy *3300	0 / 0	10
	8140	P1753F Minecraft Series brute force two pointers *3500	0 / 0	10
	8139	P1754A Technical Support greedy *800	0 / 0	3
	8138	P1754B Kevin and Permutation constructive algorithms greedy math *800	0 / 0	3
	8137	P1758A SSeeeeiinngg DDoouubbllee constructive algorithms strings *800	0 / 0	3
	8136	P1758B XOR = Average constructive algorithms *900	0 / 0	3
	8135	P1758C Almost All Multiples greedy number theory *1400	0 / 0	4
	8134	P1758D Range = √Sum binary search brute force constructive algorithms math two pointers *1800	0 / 0	6
	8133	P1758E Tick, Tock combinatorics dfs and similar dsu graphs *2500	0 / 0	9
	8132	P1758F Decent Division constructive algorithms data structures *3000	0 / 0	10
	8131	P1759A Yes-Yes? implementation strings *800	0 / 0	3
	8130	P1759B Lost Permutation math *800	0 / 0	3
	8129	P1759C Thermostat greedy math shortest paths *1100	0 / 0	3
	8128	P1759D Make It Round brute force number theory *1400	0 / 0	4
	8127	P1759E The Humanoid brute force dp sortings *1500	0 / 0	5
	8126	P1759F All Possible Digits binary search data structures greedy math number theory *1800	0 / 0	6
	8125	P1759G Restore the Permutation binary search constructive algorithms data structures greedy math *1900	0 / 0	6
	8124	P1760A Medium Number implementation sortings *800	0 / 0	3
	8123	P1760B Atilla's Favorite Problem greedy implementation strings *800	0 / 0	3
	8122	P1760C Advantage data structures implementation sortings *800	0 / 0	3
	8121	P1760D Challenging Valleys implementation two pointers *1000	0 / 0	3
	8120	P1760E Binary Inversions data structures greedy math *1100	0 / 0	3
	8119	P1760F Quests binary search greedy sortings *1500	0 / 0	5
	8118	P1760G SlavicG's Favorite Problem bitmasks dfs and similar graphs *1700	0 / 0	5
	8117	P1761A Two Permutations brute force constructive algorithms *800	0 / 0	3
	8116	P1761B Elimination of a Ring constructive algorithms greedy implementation *1000	0 / 0	3
	8115	P1761C Set Construction constructive algorithms dfs and similar graphs greedy *1400	0 / 0	4
	8114	P1761D Carry Bit combinatorics math *2100	0 / 0	7
	8113	P1761E Make It Connected binary search brute force constructive algorithms dsu graphs greedy matrices trees two pointers *2400	0 / 0	9
	8112	P1761F1 Anti-median (Easy Version) dp math *3100	0 / 0	10
	8111	P1761F2 Anti-median (Hard Version) combinatorics dp math *3500	0 / 0	10
	8110	P1761G Centroid Guess interactive probabilities trees *3500	0 / 0	10
	8252	P1762A Divide and Conquer greedy math number theory *800	0 / 0	3
	8251	P1762B Make Array Good constructive algorithms implementation number theory sortings *1100	0 / 0	3
	8250	P1762C Binary Strings are Fun combinatorics math *1400	0 / 0	4
	8249	P1762D GCD Queries constructive algorithms interactive number theory *2100	0 / 0	7
	8248	P1762E Tree Sum combinatorics math trees *2600	0 / 0	10
	8247	P1762F Good Pairs binary search data structures dp *2600	0 / 0	10
	8246	P1762G Unequal Adjacent Elements constructive algorithms sortings *3100	0 / 0	10
	8244	P1763A Absolute Maximization bitmasks constructive algorithms greedy math *800	0 / 0	3
	8245	P1763B Incinerate binary search brute force data structures implementation math sortings *1200	0 / 0	4
	8243	P1763C Another Array Problem brute force constructive algorithms greedy *2000	0 / 0	7
	8242	P1763D Valid Bitonic Permutations combinatorics dp implementation math number theory *2200	0 / 0	8
	8241	P1763E Node Pairs dp graphs math number theory *2200	0 / 0	8
	8240	P1763F Edge Queries data structures dfs and similar dp dsu graphs trees *3000	0 / 0	10
	8109	P1764A Doremy's Paint greedy *800	0 / 0	3
	8108	P1764B Doremy's Perfect Math Class math number theory *900	0 / 0	3
	8107	P1764C Doremy's City Construction graphs greedy *1400	0 / 0	4
	8106	P1764D Doremy's Pegging Game combinatorics dp math *2000	0 / 0	7
	8105	P1764E Doremy's Number Line dp greedy sortings *2400	0 / 0	9
	8104	P1764F Doremy's Experimental Tree brute force constructive algorithms dfs and similar dsu sortings trees *2500	0 / 0	9
	8103	P1764G1 Doremy's Perfect DS Class (Easy Version) binary search interactive *2900	0 / 0	10
	8102	P1764G2 Doremy's Perfect DS Class (Medium Version) binary search interactive *3000	0 / 0	10
	8101	P1764G3 Doremy's Perfect DS Class (Hard Version) binary search interactive *3300	0 / 0	10
	8100	P1764H Doremy's Paint 2 data structures *3400	0 / 0	10
	8099	P1765A Access Levels bitmasks dsu flows graph matchings *2400	0 / 0	9
	8098	P1765B Broken Keyboard greedy *800	0 / 0	3
	8097	P1765C Card Guessing combinatorics dp probabilities *2600	0 / 0	10
	8096	P1765D Watch the Videos binary search constructive algorithms two pointers *1700	0 / 0	5
	8095	P1765E Exchange brute force math *1000	0 / 0	3
	8094	P1765F Chemistry Lab dp geometry probabilities *2200	0 / 0	8
	8093	P1765G Guess the String constructive algorithms interactive probabilities *2600	0 / 0	10
	8092	P1765H Hospital Queue binary search graphs greedy implementation *2200	0 / 0	8
	8091	P1765I Infinite Chess implementation shortest paths *2800	0 / 0	10
	8090	P1765J Hero to Zero graph matchings math *2900	0 / 0	10
	8089	P1765K Torus Path greedy math *1500	0 / 0	5
	8088	P1765L Project Manager brute force data structures implementation *2400	0 / 0	9
	8087	P1765M Minimum LCM math number theory *1000	0 / 0	3
	8086	P1765N Number Reduction greedy *1500	0 / 0	5
	8238	P1766A Extremely Round brute force implementation *800	0 / 0	3
	8239	P1766B Notepad# implementation *1000	0 / 0	3
	8237	P1766C Hamiltonian Wall dp implementation *1300	0 / 0	4
	8236	P1766D Lucky Chains math number theory *1600	0 / 0	5
	8235	P1766E Decomposition binary search brute force data structures divide and conquer dp two pointers *2300	0 / 0	8
	8234	P1766F MCF flows *2800	0 / 0	10
	8233	P1767A Cut the Triangle implementation *800	0 / 0	3
	8232	P1767B Block Towers data structures greedy sortings *800	0 / 0	3
	8231	P1767C Count Binary Strings data structures dp *2100	0 / 0	7
	8230	P1767D Playoff combinatorics constructive algorithms dp greedy math *1500	0 / 0	5
	8229	P1767E Algebra Flash bitmasks brute force dp graphs math meet-in-the-middle trees *2500	0 / 0	9
	8228	P1767F Two Subtrees data structures trees *3100	0 / 0	10
	8280	P1768A Greatest Convex greedy math number theory	0 / 0	(无)
	8279	P1768B Quick Sort greedy math	0 / 0	(无)
	8278	P1768C Elemental Decompress constructive algorithms greedy implementation sortings	0 / 0	(无)
	8277	P1768D Lucky Permutation constructive algorithms dfs and similar graphs greedy	0 / 0	(无)

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