题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1465	P1381E Origami geometry math sortings *3300	0 / 0	(无)
	1464	P1382A Common Subsequence brute force *800	0 / 0	(无)
	1463	P1382B Sequential Nim dp games *1100	0 / 0	(无)
	1462	P1383A String Transformation 1 dsu graphs greedy sortings strings trees two pointers *1700	0 / 0	(无)
	1461	P1383B GameGame bitmasks constructive algorithms dp games greedy math *1900	0 / 0	(无)
	1460	P1383C String Transformation 2 bitmasks dp graphs trees *3100	0 / 0	(无)
	1459	P1383D Rearrange brute force constructive algorithms graphs greedy sortings *2800	0 / 0	(无)
	1458	P1383E Strange Operation combinatorics data structures dp *2800	0 / 0	(无)
	1457	P1383F Special Edges flows graphs *3200	0 / 0	(无)
	1456	P1384A Common Prefixes constructive algorithms greedy strings *1200	0 / 0	(无)
	1455	P1384B1 Koa and the Beach (Easy Version) brute force dp greedy *1900	0 / 0	(无)
	1454	P1384B2 Koa and the Beach (Hard Version) constructive algorithms dp greedy implementation *2200	0 / 0	(无)
	1453	P1385A Three Pairwise Maximums math *800	0 / 0	(无)
	1452	P1385B Restore the Permutation by Merger greedy *800	0 / 0	(无)
	1451	P1385C Make It Good greedy *1200	0 / 0	(无)
	1450	P1385D a-Good String bitmasks brute force divide and conquer dp implementation *1500	0 / 0	(无)
	1449	P1385E Directing Edges constructive algorithms dfs and similar graphs *2000	0 / 0	(无)
	1448	P1385F Removing Leaves data structures greedy implementation trees *2300	0 / 0	(无)
	1447	P1385G Columns Swaps 2-sat dfs and similar dsu graphs implementation *2300	0 / 0	(无)
	1446	P1386A Colors special problem binary search constructive algorithms interactive 2700	0 / 0	(无)
	1445	P1386B Mixture special problem data structures geometry math sortings 2900	0 / 0	(无)
	1444	P1386C Joker special problem bitmasks data structures divide and conquer dsu 2800	0 / 0	(无)
	1443	P1387A Graph special problem binary search dfs and similar dp math ternary search 2100	0 / 0	(无)
	1442	P1387B1 Village (Minimum) special problem dp greedy trees 2100	0 / 0	(无)
	1441	P1387B2 Village (Maximum) special problem dfs and similar trees 2500	0 / 0	(无)
	1440	P1387C Viruses special problem dp shortest paths string suffix structures 2900	0 / 0	(无)
	1439	P1388A Captain Flint and Crew Recruitment brute force greedy math number theory *800	0 / 0	(无)
	1438	P1388B Captain Flint and a Long Voyage greedy math *1000	0 / 0	(无)
	1437	P1388C Uncle Bogdan and Country Happiness dfs and similar greedy math trees *1800	0 / 0	(无)
	1436	P1388D Captain Flint and Treasure data structures dfs and similar graphs greedy implementation trees *2000	0 / 0	(无)
	1435	P1388E Uncle Bogdan and Projections data structures geometry sortings *2700	0 / 0	(无)
	1434	P1389A LCM Problem constructive algorithms greedy math number theory *800	0 / 0	(无)
	1433	P1389B Array Walk brute force dp greedy *1600	0 / 0	(无)
	1432	P1389C Good String brute force dp greedy two pointers *1500	0 / 0	(无)
	1431	P1389D Segment Intersections brute force greedy implementation math *2100	0 / 0	(无)
	1430	P1389E Calendar Ambiguity math number theory *2200	0 / 0	(无)
	1429	P1389F Bicolored Segments data structures dp graph matchings sortings *2600	0 / 0	(无)
	1428	P1389G Directing Edges dfs and similar dp graphs trees *2800	0 / 0	(无)
	1427	P1391A Suborrays constructive algorithms math *800	0 / 0	(无)
	1426	P1391B Fix You brute force greedy implementation *800	0 / 0	(无)
	1425	P1391C Cyclic Permutations combinatorics dp graphs math *1500	0 / 0	(无)
	1424	P1391D 505 bitmasks brute force constructive algorithms dp greedy implementation *2000	0 / 0	(无)
	1423	P1391E Pairs of Pairs constructive algorithms dfs and similar graphs greedy trees *2600	0 / 0	(无)
	1422	P1392A Omkar and Password greedy math *800	0 / 0	(无)
	1421	P1392B Omkar and Infinity Clock implementation math *800	0 / 0	(无)
	1420	P1392C Omkar and Waterslide greedy implementation *1200	0 / 0	(无)
	1419	P1392D Omkar and Bed Wars dp greedy *1700	0 / 0	(无)
	1418	P1392E Omkar and Duck bitmasks constructive algorithms interactive math *2100	0 / 0	(无)
	1417	P1392F Omkar and Landslide binary search constructive algorithms data structures greedy math *2400	0 / 0	(无)
	1416	P1392G Omkar and Pies bitmasks dfs and similar dp math shortest paths *2900	0 / 0	(无)
	1415	P1392H ZS Shuffles Cards combinatorics dp math probabilities *3000	0 / 0	(无)
	1414	P1392I Kevin and Grid fft graphs math *3300	0 / 0	(无)
	1413	P1393A Rainbow Dash, Fluttershy and Chess Coloring greedy math *800	0 / 0	(无)
	1412	P1393B Applejack and Storages constructive algorithms data structures greedy implementation *1400	0 / 0	(无)
	1411	P1393C Pinkie Pie Eats Patty-cakes constructive algorithms greedy math sortings *1700	0 / 0	(无)
	1410	P1393D Rarity and New Dress dfs and similar dp implementation shortest paths *2100	0 / 0	(无)
	1409	P1393E1 Twilight and Ancient Scroll (easier version) dp hashing implementation string suffix structures strings *2800	0 / 0	(无)
	1408	P1393E2 Twilight and Ancient Scroll (harder version) dp hashing implementation string suffix structures strings two pointers *3200	0 / 0	(无)
	1407	P1394A Boboniu Chats with Du dp greedy sortings two pointers *1800	0 / 0	(无)
	1406	P1394B Boboniu Walks on Graph brute force dfs and similar graphs hashing *2300	0 / 0	(无)
	1405	P1394C Boboniu and String binary search geometry ternary search *2600	0 / 0	(无)
	1404	P1394D Boboniu and Jianghu dp greedy sortings trees *2800	0 / 0	(无)
	1403	P1394E Boboniu and Banknote Collection strings *3500	0 / 0	(无)
	1402	P1395A Boboniu Likes to Color Balls brute force math *1000	0 / 0	(无)
	1401	P1395B Boboniu Plays Chess constructive algorithms *1100	0 / 0	(无)
	1400	P1395C Boboniu and Bit Operations bitmasks brute force dp greedy *1600	0 / 0	(无)
	1399	P1396A Multiples of Length constructive algorithms greedy number theory *1600	0 / 0	(无)
	1398	P1396B Stoned Game brute force constructive algorithms games greedy *1800	0 / 0	(无)
	1397	P1396C Monster Invaders dp greedy implementation *2300	0 / 0	(无)
	1396	P1396D Rainbow Rectangles data structures sortings two pointers *3300	0 / 0	(无)
	1395	P1396E Distance Matching constructive algorithms dfs and similar trees *3200	0 / 0	(无)
	1394	P1397A Juggling Letters greedy strings *800	0 / 0	(无)
	1393	P1397B Power Sequence brute force math number theory sortings *1500	0 / 0	(无)
	1392	P1398A Bad Triangle geometry math *800	0 / 0	(无)
	1391	P1398B Substring Removal Game games greedy sortings *800	0 / 0	(无)
	1390	P1398C Good Subarrays data structures dp math *1600	0 / 0	(无)
	1389	P1398D Colored Rectangles dp greedy sortings *1800	0 / 0	(无)
	1388	P1398E Two Types of Spells binary search data structures greedy implementation math sortings *2200	0 / 0	(无)
	1387	P1398F Controversial Rounds binary search data structures dp greedy two pointers *2500	0 / 0	(无)
	1386	P1398G Running Competition bitmasks fft math number theory *2600	0 / 0	(无)
	1385	P1399A Remove Smallest greedy sortings *800	0 / 0	(无)
	1384	P1399B Gifts Fixing greedy *800	0 / 0	(无)
	1383	P1399C Boats Competition brute force greedy two pointers *1200	0 / 0	(无)
	1382	P1399D Binary String To Subsequences constructive algorithms data structures greedy implementation *1500	0 / 0	(无)
	1381	P1399E1 Weights Division (easy version) data structures dfs and similar greedy trees *2000	0 / 0	(无)
	1380	P1399E2 Weights Division (hard version) binary search dfs and similar greedy sortings trees two pointers *2200	0 / 0	(无)
	1379	P1399F Yet Another Segments Subset data structures dp graphs sortings *2300	0 / 0	(无)
	1378	P1400A String Similarity constructive algorithms strings *800	0 / 0	(无)
	1377	P1400B RPG Protagonist brute force greedy math *1700	0 / 0	(无)
	1376	P1400C Binary String Reconstruction 2-sat brute force constructive algorithms greedy *1500	0 / 0	(无)
	1375	P1400D Zigzags brute force combinatorics data structures math two pointers *1900	0 / 0	(无)
	1374	P1400E Clear the Multiset data structures divide and conquer dp greedy *2200	0 / 0	(无)
	1373	P1400F x-prime Substrings brute force dfs and similar dp string suffix structures strings *2800	0 / 0	(无)
	1372	P1400G Mercenaries bitmasks brute force combinatorics dp dsu math two pointers *2600	0 / 0	(无)
	1371	P1401A Distance and Axis constructive algorithms math *900	0 / 0	(无)
	1370	P1401B Ternary Sequence constructive algorithms greedy math *1100	0 / 0	(无)
	1369	P1401C Mere Array constructive algorithms math number theory sortings *1300	0 / 0	(无)
	1368	P1401D Maximum Distributed Tree dfs and similar dp greedy implementation math number theory sortings trees *1800	0 / 0	(无)
	1367	P1401E Divide Square data structures geometry implementation sortings *2400	0 / 0	(无)
	1366	P1401F Reverse and Swap binary search bitmasks data structures *2400	0 / 0	(无)

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