题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	365	P1599F Mars hashing *2700	0 / 0	(无)
	364	P1599G Shortest path brute force geometry math shortest paths *2700	0 / 0	(无)
	363	P1599H Hidden Fortress interactive math *2100	0 / 0	(无)
	362	P1599I Desert data structures graphs *2700	0 / 0	(无)
	361	P1599J Bob's Beautiful Array bitmasks brute force greedy *2600	0 / 0	(无)
	360	P1600E Array Game games greedy two pointers *1900	0 / 0	(无)
	359	P1600F Party Organization brute force math probabilities *2300	0 / 0	(无)
	358	P1600J Robot Factory bitmasks dfs and similar *1400	0 / 0	(无)
	357	P1601A Array Elimination bitmasks greedy math number theory *1300	0 / 0	(无)
	356	P1601B Frog Traveler data structures dfs and similar dp graphs shortest paths two pointers *1900	0 / 0	(无)
	355	P1601C Optimal Insertion data structures divide and conquer dp greedy sortings *2300	0 / 0	(无)
	354	P1601D Difficult Mountain data structures dp greedy sortings *2700	0 / 0	(无)
	353	P1601E Phys Ed Online data structures dp greedy *2900	0 / 0	(无)
	352	P1601F Two Sorts binary search dfs and similar math meet-in-the-middle *3400	0 / 0	(无)
	351	P1602A Two Subsequences implementation *800	0 / 0	(无)
	350	P1602B Divine Array constructive algorithms implementation *1100	0 / 0	(无)
	349	P1603A Di-visible Confusion constructive algorithms math number theory *1300	0 / 0	(无)
	348	P1603B Moderate Modular Mode constructive algorithms math number theory *1600	0 / 0	(无)
	347	P1603C Extreme Extension dp greedy math number theory *2300	0 / 0	(无)
	346	P1603D Artistic Partition divide and conquer dp number theory *3000	0 / 0	(无)
	345	P1603E A Perfect Problem combinatorics dp math *3200	0 / 0	(无)
	344	P1603F October 18, 2017 combinatorics dp implementation math *2700	0 / 0	(无)
	343	P1604A Era greedy *800	0 / 0	(无)
	342	P1604B XOR Specia-LIS-t *1100	0 / 0	(无)
	341	P1605A A.M math number theory *800	0 / 0	(无)
	340	P1605B Reverse Sort greedy sortings *1000	0 / 0	(无)
	339	P1605C Dominant Character brute force greedy implementation strings *1400	0 / 0	(无)
	338	P1605D Treelabeling bitmasks constructive algorithms dfs and similar games greedy implementation trees *2100	0 / 0	(无)
	337	P1605E Array Equalizer binary search greedy implementation math number theory sortings two pointers *2400	0 / 0	(无)
	336	P1605F PalindORme combinatorics dp *2900	0 / 0	(无)
	335	P1606A AB Balance strings *900	0 / 0	(无)
	334	P1606B Update Files greedy implementation math *1100	0 / 0	(无)
	333	P1606C Banknotes greedy number theory *1400	0 / 0	(无)
	332	P1606D Red-Blue Matrix brute force constructive algorithms implementation sortings *2400	0 / 0	(无)
	331	P1606E Arena combinatorics dp math *2100	0 / 0	(无)
	330	P1606F Tree Queries brute force dp trees *2800	0 / 0	(无)
	329	P1607A Linear Keyboard implementation strings *800	0 / 0	(无)
	328	P1607B Odd Grasshopper math *900	0 / 0	(无)
	327	P1607C Minimum Extraction brute force sortings *1000	0 / 0	(无)
	326	P1607D Blue-Red Permutation greedy math sortings *1300	0 / 0	(无)
	325	P1607E Robot on the Board 1 implementation *1600	0 / 0	(无)
	324	P1607F Robot on the Board 2 brute force dfs and similar graphs implementation *2300	0 / 0	(无)
	323	P1607G Banquet Preparations 1 greedy *2200	0 / 0	(无)
	322	P1607H Banquet Preparations 2 greedy sortings two pointers *2200	0 / 0	(无)
	321	P1608A Find Array constructive algorithms math *800	0 / 0	(无)
	320	P1608B Build the Permutation constructive algorithms greedy *1200	0 / 0	(无)
	319	P1608C Game Master data structures dfs and similar dp graphs greedy two pointers *1700	0 / 0	(无)
	318	P1608D Dominoes combinatorics fft graphs math number theory *2400	0 / 0	(无)
	317	P1608E The Cells on the Paper binary search implementation sortings *2800	0 / 0	(无)
	316	P1608F MEX counting combinatorics dp implementation *3200	0 / 0	(无)
	315	P1608G Alphabetic Tree binary search data structures dfs and similar hashing string suffix structures strings trees *3500	0 / 0	(无)
	314	P1609A Divide and Multiply greedy implementation math number theory *900	0 / 0	(无)
	313	P1609B William the Vigilant implementation strings *1100	0 / 0	(无)
	312	P1609C Complex Market Analysis binary search dp implementation number theory schedules two pointers *1400	0 / 0	(无)
	311	P1609D Social Network dsu graphs greedy implementation trees *1600	0 / 0	(无)
	310	P1609E William The Oblivious bitmasks data structures dp matrices *2400	0 / 0	(无)
	309	P1609F Interesting Sections data structures divide and conquer meet-in-the-middle two pointers *2800	0 / 0	(无)
	308	P1609G A Stroll Around the Matrix data structures greedy math *3000	0 / 0	(无)
	307	P1609H Pushing Robots *3500	0 / 0	(无)
	306	P1610A Anti Light's Cell Guessing math *900	0 / 0	(无)
	305	P1610B Kalindrome Array greedy two pointers *1100	0 / 0	(无)
	304	P1610C Keshi Is Throwing a Party binary search greedy *1600	0 / 0	(无)
	303	P1610D Not Quite Lee combinatorics dp math number theory *2000	0 / 0	(无)
	302	P1610E AmShZ and G.O.A.T. binary search brute force greedy implementation math *2300	0 / 0	(无)
	301	P1610F Mashtali: a Space Oddysey constructive algorithms dfs and similar graphs *3000	0 / 0	(无)
	300	P1610G AmShZ Wins a Bet data structures greedy hashing *3300	0 / 0	(无)
	299	P1610H Squid Game data structures dfs and similar greedy trees *3100	0 / 0	(无)
	298	P1610I Mashtali vs AtCoder games trees *3100	0 / 0	(无)
	297	P1611A Make Even constructive algorithms math *800	0 / 0	(无)
	296	P1611B Team Composition: Programmers and Mathematicians binary search constructive algorithms math *800	0 / 0	(无)
	295	P1611C Polycarp Recovers the Permutation constructive algorithms *1000	0 / 0	(无)
	294	P1611D Weights Assignment For Tree Edges constructive algorithms trees *1500	0 / 0	(无)
	293	P1611E1 Escape The Maze (easy version) dfs and similar greedy shortest paths trees two pointers *1700	0 / 0	(无)
	292	P1611E2 Escape The Maze (hard version) dfs and similar dp greedy shortest paths trees *1900	0 / 0	(无)
	291	P1611F ATM and Students binary search data structures two pointers *1800	0 / 0	(无)
	290	P1611G Robot and Candies data structures graph matchings greedy *2500	0 / 0	(无)
	289	P1612A Distance brute force constructive algorithms *800	0 / 0	(无)
	288	P1612B Special Permutation constructive algorithms greedy *900	0 / 0	(无)
	287	P1612C Chat Ban binary search math *1300	0 / 0	(无)
	286	P1612D X-Magic Pair math number theory *1600	0 / 0	(无)
	285	P1612E Messages brute force dp greedy probabilities sortings *2000	0 / 0	(无)
	284	P1612F Armor and Weapons brute force dp greedy shortest paths *2800	0 / 0	(无)
	283	P1612G Max Sum Array combinatorics constructive algorithms greedy sortings *2500	0 / 0	(无)
	282	P1613A Long Comparison implementation math *900	0 / 0	(无)
	281	P1613B Absent Remainder greedy implementation sortings *1000	0 / 0	(无)
	280	P1613C Poisoned Dagger binary search *1200	0 / 0	(无)
	279	P1613D MEX Sequences dp math *1900	0 / 0	(无)
	278	P1613E Crazy Robot dfs and similar graphs *2000	0 / 0	(无)
	277	P1613F Tree Coloring combinatorics divide and conquer fft *2600	0 / 0	(无)
	276	P1614A Divan and a Store brute force constructive algorithms greedy *800	0 / 0	(无)
	275	P1614B Divan and a New Project constructive algorithms sortings *1000	0 / 0	(无)
	274	P1614C Divan and bitwise operations bitmasks combinatorics constructive algorithms dp math *1500	0 / 0	(无)
	273	P1614D1 Divan and Kostomuksha (easy version) dp number theory *2100	0 / 0	(无)
	272	P1614D2 Divan and Kostomuksha (hard version) dp number theory *2300	0 / 0	(无)
	271	P1614E Divan and a Cottage binary search data structures *2600	0 / 0	(无)
	270	P1615A Closing The Gap greedy math *800	0 / 0	(无)
	269	P1615B And It's Non-Zero bitmasks greedy math *1300	0 / 0	(无)
	268	P1615C Menorah brute force graphs greedy math *1600	0 / 0	(无)
	267	P1615D X(or)-mas Tree bitmasks dfs and similar dsu graphs trees *2200	0 / 0	(无)
	266	P1615E Purple Crayon data structures dfs and similar games graphs greedy math sortings trees *2400	0 / 0	(无)

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