题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	665	P1537D Deleting Divisors games math number theory *1700	0 / 0	(无)
	664	P1537E1 Erase and Extend (Easy Version) binary search brute force dp greedy hashing implementation string suffix structures strings two pointers *1600	0 / 0	(无)
	663	P1537E2 Erase and Extend (Hard Version) binary search data structures greedy hashing string suffix structures strings two pointers *2200	0 / 0	(无)
	662	P1537F Figure Fixing constructive algorithms dfs and similar dsu graphs greedy math *2200	0 / 0	(无)
	661	P1538A Stone Game brute force dp greedy *800	0 / 0	(无)
	660	P1538B Friends and Candies greedy math *800	0 / 0	(无)
	659	P1538C Number of Pairs binary search data structures math two pointers *1300	0 / 0	(无)
	658	P1538D Another Problem About Dividing Numbers constructive algorithms math number theory *1700	0 / 0	(无)
	657	P1538E Funny Substrings data structures hashing implementation matrices strings *2100	0 / 0	(无)
	656	P1538F Interesting Function binary search dp math number theory *1500	0 / 0	(无)
	655	P1538G Gift Set binary search greedy math ternary search *2100	0 / 0	(无)
	654	P1539A Contest Start combinatorics geometry greedy math *1000	0 / 0	(无)
	653	P1539B Love Song dp implementation strings *800	0 / 0	(无)
	652	P1539C Stable Groups greedy sortings *1200	0 / 0	(无)
	651	P1539D PriceFixed binary search greedy implementation sortings two pointers *1600	0 / 0	(无)
	650	P1539E Game with Cards binary search constructive algorithms data structures dp greedy implementation *2500	0 / 0	(无)
	649	P1539F Strange Array data structures greedy sortings *2600	0 / 0	(无)
	648	P1540A Great Graphs constructive algorithms graphs greedy shortest paths sortings *1400	0 / 0	(无)
	647	P1540B Tree Array brute force combinatorics dp graphs math probabilities trees *2300	0 / 0	(无)
	646	P1540C1 Converging Array (Easy Version) dp math *2700	0 / 0	(无)
	645	P1540C2 Converging Array (Hard Version) dp math *2900	0 / 0	(无)
	644	P1540D Inverse Inversions binary search brute force data structures *3200	0 / 0	(无)
	643	P1540E Tasty Dishes math matrices *3500	0 / 0	(无)
	642	P1541A Pretty Permutations constructive algorithms greedy implementation *800	0 / 0	(无)
	641	P1541B Pleasant Pairs brute force implementation math number theory *1200	0 / 0	(无)
	640	P1542A Odd Set math *800	0 / 0	(无)
	639	P1542B Plus and Multiply constructive algorithms math number theory *1500	0 / 0	(无)
	638	P1542C Strange Function math number theory *1600	0 / 0	(无)
	637	P1542D Priority Queue combinatorics dp implementation math ternary search *2200	0 / 0	(无)
	636	P1542E1 Abnormal Permutation Pairs (easy version) combinatorics dp fft math *2400	0 / 0	(无)
	635	P1542E2 Abnormal Permutation Pairs (hard version) combinatorics dp fft math *2700	0 / 0	(无)
	634	P1543A Exciting Bets greedy math number theory *900	0 / 0	(无)
	633	P1543B Customising the Track combinatorics greedy math *900	0 / 0	(无)
	632	P1543C Need for Pink Slips bitmasks brute force dfs and similar implementation math probabilities *1900	0 / 0	(无)
	631	P1543D1 RPD and Rap Sheet (Easy Version) bitmasks constructive algorithms interactive math *1700	0 / 0	(无)
	630	P1543D2 RPD and Rap Sheet (Hard Version) brute force constructive algorithms interactive math *2200	0 / 0	(无)
	629	P1543E The Final Pursuit bitmasks constructive algorithms divide and conquer graphs greedy math *2700	0 / 0	(无)
	628	P1545A AquaMoon and Strange Sort sortings *1500	0 / 0	(无)
	627	P1545B AquaMoon and Chess combinatorics math *1900	0 / 0	(无)
	626	P1545C AquaMoon and Permutations 2-sat brute force combinatorics constructive algorithms graph matchings graphs *2800	0 / 0	(无)
	625	P1545D AquaMoon and Wrong Coordinate constructive algorithms interactive math *3000	0 / 0	(无)
	624	P1545E1 AquaMoon and Time Stop (easy version) data structures dp *3500	0 / 0	(无)
	623	P1545E2 AquaMoon and Time Stop (hard version) data structures dp *3500	0 / 0	(无)
	622	P1545F AquaMoon and Potatoes brute force data structures dp *3500	0 / 0	(无)
	621	P1546A AquaMoon and Two Arrays brute force greedy *800	0 / 0	(无)
	620	P1546B AquaMoon and Stolen String interactive math *1200	0 / 0	(无)
	619	P1547A Shortest Path with Obstacle implementation math *800	0 / 0	(无)
	618	P1547B Alphabetical Strings greedy implementation strings *800	0 / 0	(无)
	617	P1547C Pair Programming greedy two pointers *1100	0 / 0	(无)
	616	P1547D Co-growing Sequence bitmasks constructive algorithms greedy *1300	0 / 0	(无)
	615	P1547E Air Conditioners data structures dp implementation shortest paths sortings two pointers *1500	0 / 0	(无)
	614	P1547F Array Stabilization (GCD version) binary search brute force data structures divide and conquer number theory two pointers *1900	0 / 0	(无)
	613	P1547G How Many Paths? dfs and similar dp graphs trees *2100	0 / 0	(无)
	612	P1548A Web of Lies brute force graphs greedy *1400	0 / 0	(无)
	611	P1548B Integers Have Friends binary search data structures divide and conquer math number theory two pointers *1800	0 / 0	(无)
	610	P1548C The Three Little Pigs combinatorics dp fft math *2500	0 / 0	(无)
	609	P1548D1 Gregor and the Odd Cows (Easy) bitmasks geometry math number theory *2300	0 / 0	(无)
	608	P1548D2 Gregor and the Odd Cows (Hard) brute force geometry math number theory *3300	0 / 0	(无)
	607	P1548E Gregor and the Two Painters data structures divide and conquer graphs greedy math *3400	0 / 0	(无)
	606	P1549A Gregor and Cryptography math number theory *800	0 / 0	(无)
	605	P1549B Gregor and the Pawn Game dfs and similar dp flows graph matchings graphs greedy implementation *800	0 / 0	(无)
	604	P1550A Find The Array greedy math *800	0 / 0	(无)
	603	P1550B Maximum Cost Deletion greedy math *1000	0 / 0	(无)
	602	P1550C Manhattan Subarrays brute force geometry greedy implementation *1700	0 / 0	(无)
	601	P1550D Excellent Arrays binary search combinatorics constructive algorithms implementation math sortings two pointers *2300	0 / 0	(无)
	600	P1550E Stringforces binary search bitmasks brute force dp strings two pointers *2500	0 / 0	(无)
	599	P1550F Jumping Around binary search data structures divide and conquer dp dsu graphs shortest paths *2700	0 / 0	(无)
	598	P1551A Polycarp and Coins greedy math *800	0 / 0	(无)
	597	P1551B1 Wonderful Coloring - 1 greedy strings *800	0 / 0	(无)
	596	P1551B2 Wonderful Coloring - 2 binary search constructive algorithms data structures greedy *1400	0 / 0	(无)
	595	P1551C Interesting Story greedy sortings strings *1500	0 / 0	(无)
	594	P1551D1 Domino (easy version) constructive algorithms math *1700	0 / 0	(无)
	593	P1551D2 Domino (hard version) constructive algorithms implementation math *2100	0 / 0	(无)
	592	P1551E Fixed Points binary search brute force dp *2000	0 / 0	(无)
	591	P1551F Equidistant Vertices brute force combinatorics dfs and similar dp trees *2200	0 / 0	(无)
	590	P1552A Subsequence Permutation sortings strings *800	0 / 0	(无)
	589	P1552B Running for Gold combinatorics graphs greedy sortings *1500	0 / 0	(无)
	588	P1552C Maximize the Intersections combinatorics constructive algorithms geometry greedy sortings *1800	0 / 0	(无)
	587	P1552D Array Differentiation bitmasks brute force constructive algorithms dfs and similar dp graphs math *1800	0 / 0	(无)
	586	P1552E Colors and Intervals constructive algorithms data structures greedy sortings *2300	0 / 0	(无)
	585	P1552F Telepanting binary search data structures dp sortings *2200	0 / 0	(无)
	584	P1552G A Serious Referee bitmasks brute force dfs and similar sortings *3000	0 / 0	(无)
	583	P1552H Guess the Perimeter binary search interactive number theory *3300	0 / 0	(无)
	582	P1552I Organizing a Music Festival dfs and similar math *3400	0 / 0	(无)
	581	P1553A Digits Sum math number theory *800	0 / 0	(无)
	580	P1553B Reverse String brute force dp hashing implementation strings *1300	0 / 0	(无)
	579	P1553C Penalty bitmasks brute force dp greedy *1200	0 / 0	(无)
	578	P1553D Backspace dp greedy strings two pointers *1500	0 / 0	(无)
	577	P1553E Permutation Shift brute force combinatorics constructive algorithms dfs and similar dsu graphs math *2100	0 / 0	(无)
	576	P1553F Pairwise Modulo data structures math *2300	0 / 0	(无)
	575	P1553G Common Divisor Graph brute force constructive algorithms dsu graphs hashing math number theory *2700	0 / 0	(无)
	574	P1553H XOR and Distance bitmasks divide and conquer trees *2900	0 / 0	(无)
	573	P1553I Stairs combinatorics divide and conquer dp fft math *3400	0 / 0	(无)
	572	P1554A Cherry greedy *800	0 / 0	(无)
	571	P1554B Cobb bitmasks brute force greedy math *1700	0 / 0	(无)
	570	P1554C Mikasa binary search bitmasks greedy implementation *1800	0 / 0	(无)
	569	P1554D Diane constructive algorithms greedy strings *1800	0 / 0	(无)
	568	P1554E You dfs and similar dp math number theory *2600	0 / 0	(无)
	567	P1555A PizzaForces brute force math *900	0 / 0	(无)
	566	P1555B Two Tables brute force *1300	0 / 0	(无)

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