题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	565	P1555C Coin Rows brute force constructive algorithms dp implementation *1300	0 / 0	(无)
	564	P1555D Say No to Palindromes brute force constructive algorithms dp strings *1600	0 / 0	(无)
	563	P1555E Boring Segments data structures sortings trees two pointers *2100	0 / 0	(无)
	562	P1555F Good Graph data structures dsu graphs trees *2700	0 / 0	(无)
	561	P1556A A Variety of Operations math *800	0 / 0	(无)
	560	P1556B Take Your Places! implementation *1300	0 / 0	(无)
	559	P1556C Compressed Bracket Sequence brute force implementation *1800	0 / 0	(无)
	558	P1556D Take a Guess bitmasks constructive algorithms interactive math *1800	0 / 0	(无)
	557	P1556E Equilibrium data structures dp greedy *2200	0 / 0	(无)
	556	P1556F Sports Betting bitmasks combinatorics dp graphs math probabilities *2500	0 / 0	(无)
	555	P1556G Gates to Another World bitmasks data structures dsu two pointers *3300	0 / 0	(无)
	554	P1556H DIY Tree graphs greedy math probabilities *3300	0 / 0	(无)
	553	P1557A Ezzat and Two Subsequences brute force math sortings *800	0 / 0	(无)
	552	P1557B Moamen and k-subarrays greedy sortings *1100	0 / 0	(无)
	551	P1557C Moamen and XOR bitmasks combinatorics dp math matrices *1700	0 / 0	(无)
	550	P1557D Ezzat and Grid data structures dp greedy *2200	0 / 0	(无)
	549	P1557E Assiut Chess brute force constructive algorithms interactive *2800	0 / 0	(无)
	548	P1558A Charmed by the Game brute force math *1300	0 / 0	(无)
	547	P1558B Up the Strip brute force dp math number theory two pointers *1900	0 / 0	(无)
	546	P1558C Bottom-Tier Reversals constructive algorithms greedy *2000	0 / 0	(无)
	545	P1558D Top-Notch Insertions combinatorics data structures *2600	0 / 0	(无)
	544	P1558E Down Below binary search dfs and similar graphs greedy meet-in-the-middle shortest paths *3000	0 / 0	(无)
	543	P1558F Strange Sort data structures sortings *3300	0 / 0	(无)
	542	P1559A Mocha and Math bitmasks constructive algorithms math *900	0 / 0	(无)
	541	P1559B Mocha and Red and Blue dp greedy *900	0 / 0	(无)
	540	P1559C Mocha and Hiking constructive algorithms graphs *1200	0 / 0	(无)
	539	P1559D1 Mocha and Diana (Easy Version) brute force constructive algorithms dsu graphs greedy trees *1400	0 / 0	(无)
	538	P1559D2 Mocha and Diana (Hard Version) brute force constructive algorithms dfs and similar dsu graphs greedy trees two pointers *2500	0 / 0	(无)
	537	P1559E Mocha and Stars combinatorics dp fft math number theory *2200	0 / 0	(无)
	536	P1560A Dislike of Threes implementation *800	0 / 0	(无)
	535	P1560B Who's Opposite? math *800	0 / 0	(无)
	534	P1560C Infinity Table implementation math *800	0 / 0	(无)
	533	P1560D Make a Power of Two greedy math strings *1300	0 / 0	(无)
	532	P1560E Polycarp and String Transformation binary search implementation sortings strings *1800	0 / 0	(无)
	531	P1560F1 Nearest Beautiful Number (easy version) binary search bitmasks brute force constructive algorithms dfs and similar greedy *1900	0 / 0	(无)
	530	P1560F2 Nearest Beautiful Number (hard version) bitmasks brute force constructive algorithms dfs and similar dp greedy *2100	0 / 0	(无)
	529	P1561A Simply Strange Sort brute force implementation sortings *800	0 / 0	(无)
	528	P1561C Deep Down Below binary search greedy sortings *1300	0 / 0	(无)
	527	P1561D1 Up the Strip (simplified version) brute force data structures dp math number theory *1700	0 / 0	(无)
	526	P1562A The Miracle and the Sleeper greedy math *800	0 / 0	(无)
	525	P1562B Scenes From a Memory brute force constructive algorithms implementation math number theory *1000	0 / 0	(无)
	524	P1562C Rings constructive algorithms math *1500	0 / 0	(无)
	523	P1562D1 Two Hundred Twenty One (easy version) data structures dp math *1700	0 / 0	(无)
	522	P1562D2 Two Hundred Twenty One (hard version) data structures math *2200	0 / 0	(无)
	521	P1562E Rescue Niwen! dp greedy string suffix structures strings *2500	0 / 0	(无)
	520	P1562F Tubular Bells interactive math number theory probabilities *2900	0 / 0	(无)
	519	P1566A Median Maximization binary search greedy math *800	0 / 0	(无)
	518	P1566B MIN-MEX Cut bitmasks constructive algorithms dp greedy *800	0 / 0	(无)
	517	P1566C MAX-MEX Cut bitmasks constructive algorithms dp greedy *1000	0 / 0	(无)
	516	P1566D1 Seating Arrangements (easy version) data structures greedy sortings *1100	0 / 0	(无)
	515	P1566D2 Seating Arrangements (hard version) data structures greedy implementation sortings two pointers *1600	0 / 0	(无)
	514	P1566E Buds Re-hanging constructive algorithms dfs and similar dp greedy trees *2000	0 / 0	(无)
	513	P1566F Points Movement data structures dp greedy implementation sortings *2600	0 / 0	(无)
	512	P1566G Four Vertices constructive algorithms data structures graphs greedy implementation shortest paths *3100	0 / 0	(无)
	511	P1566H Xor-quiz constructive algorithms dp interactive math number theory *3200	0 / 0	(无)
	510	P1567A Domino Disaster implementation strings *800	0 / 0	(无)
	509	P1567B MEXor Mixup bitmasks greedy *1000	0 / 0	(无)
	508	P1567C Carrying Conundrum bitmasks combinatorics dp math *1600	0 / 0	(无)
	507	P1567D Expression Evaluation Error constructive algorithms greedy implementation math *2000	0 / 0	(无)
	506	P1567E Non-Decreasing Dilemma data structures divide and conquer math *2200	0 / 0	(无)
	505	P1567F One-Four Overload 2-sat constructive algorithms dfs and similar dsu graphs implementation *2700	0 / 0	(无)
	504	P1569A Balanced Substring implementation *800	0 / 0	(无)
	503	P1569B Chess Tournament constructive algorithms *1000	0 / 0	(无)
	502	P1569C Jury Meeting combinatorics math *1500	0 / 0	(无)
	501	P1569D Inconvenient Pairs binary search data structures implementation sortings two pointers *1900	0 / 0	(无)
	500	P1569E Playoff Restoration bitmasks brute force hashing implementation meet-in-the-middle *2600	0 / 0	(无)
	499	P1569F Palindromic Hamiltonian Path brute force dfs and similar dp graphs hashing *3000	0 / 0	(无)
	498	P1571A Sequence of Comparisons special problem 800	0 / 0	(无)
	497	P1571B Epic Novel special problem math 1300	0 / 0	(无)
	496	P1571C Rhyme special problem implementation 1800	0 / 0	(无)
	495	P1571D Sweepstake special problem brute force constructive algorithms implementation math 1800	0 / 0	(无)
	494	P1571E Fix the String special problem bitmasks dp greedy 1700	0 / 0	(无)
	493	P1571F Kotlinforces special problem constructive algorithms dp 2000	0 / 0	(无)
	492	P1571G A Battle Against a Dragon special problem data structures dp 2500	0 / 0	(无)
	491	P1571H Laser Beams special problem geometry probabilities 2900	0 / 0	(无)
	490	P1571I Physical Examination special problem binary search data structures 3200	0 / 0	(无)
	489	P1571J Two Railroads special problem 3000	0 / 0	(无)
	488	P1572A Book binary search brute force data structures dp graphs implementation sortings *1800	0 / 0	(无)
	487	P1572B Xor of 3 brute force constructive algorithms greedy two pointers *2500	0 / 0	(无)
	486	P1572C Paint dp greedy *2700	0 / 0	(无)
	485	P1572D Bridge Club flows graph matchings graphs greedy *2800	0 / 0	(无)
	484	P1572E Polygon binary search dp geometry *3000	0 / 0	(无)
	483	P1572F Stations data structures *3400	0 / 0	(无)
	482	P1573A Countdown greedy *800	0 / 0	(无)
	481	P1573B Swaps greedy math sortings *1400	0 / 0	(无)
	480	P1574A Regular Bracket Sequences constructive algorithms *800	0 / 0	(无)
	479	P1574B Combinatorics Homework combinatorics greedy math *1100	0 / 0	(无)
	478	P1574C Slay the Dragon binary search greedy sortings ternary search *1300	0 / 0	(无)
	477	P1574D The Strongest Build binary search brute force data structures dfs and similar graphs greedy hashing implementation *2000	0 / 0	(无)
	476	P1574E Coloring combinatorics constructive algorithms implementation math *2500	0 / 0	(无)
	475	P1574F Occurrences combinatorics dfs and similar dp dsu fft graphs *2700	0 / 0	(无)
	474	P1575A Another Sorting Problem data structures sortings strings *1100	0 / 0	(无)
	473	P1575B Building an Amusement Park binary search geometry *2300	0 / 0	(无)
	472	P1575C Cyclic Sum data structures fft number theory *3000	0 / 0	(无)
	471	P1575D Divisible by Twenty-Five brute force dfs and similar dp *1800	0 / 0	(无)
	470	P1575E Eye-Pleasing City Park Tour data structures trees *2600	0 / 0	(无)
	469	P1575F Finding Expected Value math *2900	0 / 0	(无)
	468	P1575G GCD Festival math number theory *2200	0 / 0	(无)
	467	P1575H Holiday Wall Ornaments dp strings *2200	0 / 0	(无)
	466	P1575I Illusions of the Desert data structures trees *2300	0 / 0	(无)

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