题库 - FJNU

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	1565	P1364D Ehab's Last Corollary constructive algorithms dfs and similar graphs greedy implementation trees *2100	0 / 0	(无)
	1564	P1364E X-OR bitmasks constructive algorithms divide and conquer interactive probabilities *2700	0 / 0	(无)
	1563	P1365A Matrix Game games greedy implementation *1100	0 / 0	(无)
	1562	P1365B Trouble Sort constructive algorithms implementation *1300	0 / 0	(无)
	1561	P1365C Rotation Matching constructive algorithms data structures greedy implementation *1400	0 / 0	(无)
	1560	P1365D Solve The Maze constructive algorithms dfs and similar dsu graphs greedy implementation shortest paths *1700	0 / 0	(无)
	1559	P1365E Maximum Subsequence Value brute force constructive algorithms *1900	0 / 0	(无)
	1558	P1365F Swaps Again constructive algorithms implementation sortings *2100	0 / 0	(无)
	1557	P1365G Secure Password bitmasks combinatorics constructive algorithms interactive math *2800	0 / 0	(无)
	1556	P1366A Shovels and Swords binary search greedy math *1100	0 / 0	(无)
	1555	P1366B Shuffle math two pointers *1300	0 / 0	(无)
	1554	P1366C Palindromic Paths greedy math *1500	0 / 0	(无)
	1553	P1366D Two Divisors constructive algorithms math number theory *2000	0 / 0	(无)
	1552	P1366E Two Arrays binary search brute force combinatorics constructive algorithms dp two pointers *2100	0 / 0	(无)
	1551	P1366F Jog Around The Graph binary search dp geometry graphs *2700	0 / 0	(无)
	1550	P1366G Construct the String data structures dp strings *2700	0 / 0	(无)
	1549	P1367A Short Substrings implementation strings *800	0 / 0	(无)
	1548	P1367B Even Array greedy math *800	0 / 0	(无)
	1547	P1367C Social Distance constructive algorithms greedy math *1300	0 / 0	(无)
	1546	P1367D Task On The Board constructive algorithms greedy implementation sortings *1800	0 / 0	(无)
	1545	P1367E Necklace Assembly brute force dfs and similar dp graphs greedy number theory *1900	0 / 0	(无)
	1544	P1367F1 Flying Sort (Easy Version) dp greedy two pointers *2100	0 / 0	(无)
	1543	P1367F2 Flying Sort (Hard Version) binary search data structures dp greedy sortings two pointers *2400	0 / 0	(无)
	1542	P1368A C+= brute force greedy implementation math *800	0 / 0	(无)
	1541	P1368B Codeforces Subsequences brute force constructive algorithms greedy math strings *1500	0 / 0	(无)
	1540	P1368C Even Picture constructive algorithms *1500	0 / 0	(无)
	1539	P1368D AND, OR and square sum bitmasks greedy math *1700	0 / 0	(无)
	1538	P1368E Ski Accidents constructive algorithms graphs greedy *2500	0 / 0	(无)
	1537	P1368F Lamps on a Circle games implementation interactive math *2600	0 / 0	(无)
	1536	P1368G Shifting Dominoes data structures geometry graphs trees *3200	0 / 0	(无)
	1535	P1368H1 Breadboard Capacity (easy version) dp flows greedy *3300	0 / 0	(无)
	1534	P1368H2 Breadboard Capacity (hard version) *3500	0 / 0	(无)
	1533	P1369A FashionabLee geometry math *800	0 / 0	(无)
	1532	P1369B AccurateLee greedy implementation strings *1200	0 / 0	(无)
	1531	P1369C RationalLee greedy math sortings two pointers *1400	0 / 0	(无)
	1530	P1369D TediousLee dp graphs greedy math trees *1900	0 / 0	(无)
	1529	P1369E DeadLee data structures dfs and similar greedy implementation sortings *2400	0 / 0	(无)
	1528	P1369F BareLee dfs and similar dp games *2700	0 / 0	(无)
	1527	P1370A Maximum GCD greedy implementation math number theory *800	0 / 0	(无)
	1526	P1370B GCD Compression constructive algorithms math number theory *1100	0 / 0	(无)
	1525	P1370C Number Game games math number theory *1400	0 / 0	(无)
	1524	P1370D Odd-Even Subsequence binary search dp dsu greedy implementation *2000	0 / 0	(无)
	1523	P1370E Binary Subsequence Rotation binary search constructive algorithms data structures greedy *2100	0 / 0	(无)
	1522	P1370F1 The Hidden Pair (Easy Version) binary search dfs and similar graphs interactive shortest paths trees *2400	0 / 0	(无)
	1521	P1370F2 The Hidden Pair (Hard Version) binary search dfs and similar graphs interactive shortest paths trees *2700	0 / 0	(无)
	1520	P1371A Magical Sticks math *800	0 / 0	(无)
	1519	P1371B Magical Calendar math *1200	0 / 0	(无)
	1518	P1371C A Cookie for You greedy implementation math *1300	0 / 0	(无)
	1517	P1371D Grid-00100 constructive algorithms greedy implementation *1600	0 / 0	(无)
	1516	P1371E1 Asterism (Easy Version) binary search brute force combinatorics math number theory sortings *1900	0 / 0	(无)
	1515	P1371E2 Asterism (Hard Version) binary search combinatorics dp math number theory sortings *2300	0 / 0	(无)
	1514	P1371F Raging Thunder data structures divide and conquer implementation *2800	0 / 0	(无)
	1513	P1372A Omkar and Completion constructive algorithms implementation *800	0 / 0	(无)
	1512	P1372B Omkar and Last Class of Math greedy math number theory *1300	0 / 0	(无)
	1511	P1372C Omkar and Baseball constructive algorithms math *1500	0 / 0	(无)
	1510	P1372D Omkar and Circle brute force dp games greedy *2100	0 / 0	(无)
	1509	P1372E Omkar and Last Floor dp greedy two pointers *2900	0 / 0	(无)
	1508	P1372F Omkar and Modes binary search divide and conquer interactive *2700	0 / 0	(无)
	1507	P1373A Donut Shops greedy implementation math *1000	0 / 0	(无)
	1506	P1373B 01 Game games *900	0 / 0	(无)
	1505	P1373C Pluses and Minuses math *1300	0 / 0	(无)
	1504	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	(无)
	1503	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	(无)
	1502	P1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	(无)
	1501	P1373G Pawns data structures divide and conquer greedy *2600	0 / 0	(无)
	1500	P1374A Required Remainder math *800	0 / 0	(无)
	1499	P1374B Multiply by 2, divide by 6 math *900	0 / 0	(无)
	1498	P1374C Move Brackets greedy strings *1000	0 / 0	(无)
	1497	P1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	(无)
	1496	P1374E1 Reading Books (easy version) data structures greedy sortings *1600	0 / 0	(无)
	1495	P1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	(无)
	1494	P1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	(无)
	1493	P1375A Sign Flipping constructive algorithms math *1100	0 / 0	(无)
	1492	P1375B Neighbor Grid constructive algorithms greedy *1200	0 / 0	(无)
	1491	P1375C Element Extermination constructive algorithms data structures greedy *1400	0 / 0	(无)
	1490	P1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	(无)
	1489	P1375E Inversion SwapSort constructive algorithms greedy sortings *2500	0 / 0	(无)
	1488	P1375F Integer Game constructive algorithms games interactive math *2600	0 / 0	(无)
	1487	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(无)
	1486	P1375H Set Merging constructive algorithms divide and conquer *3300	0 / 0	(无)
	1485	P1375I Cubic Lattice geometry math matrices number theory *3500	0 / 0	(无)
	1484	P1379A Acacius and String brute force implementation strings *1500	0 / 0	(无)
	1483	P1379B Dubious Cyrpto binary search brute force math number theory *1500	0 / 0	(无)
	1482	P1379C Choosing flowers binary search brute force data structures dfs and similar dp greedy sortings two pointers *2000	0 / 0	(无)
	1481	P1379D New Passenger Trams binary search brute force data structures sortings two pointers *2300	0 / 0	(无)
	1480	P1379E Inverse Genealogy constructive algorithms divide and conquer dp math trees *2800	0 / 0	(无)
	1479	P1379F1 Chess Strikes Back (easy version) binary search data structures *2700	0 / 0	(无)
	1478	P1379F2 Chess Strikes Back (hard version) data structures divide and conquer *2800	0 / 0	(无)
	1477	P1380A Three Indices brute force data structures *900	0 / 0	(无)
	1476	P1380B Universal Solution greedy *1400	0 / 0	(无)
	1475	P1380C Create The Teams brute force dp greedy implementation sortings *1400	0 / 0	(无)
	1474	P1380D Berserk And Fireball constructive algorithms greedy implementation math two pointers *2000	0 / 0	(无)
	1473	P1380E Merging Towers data structures dsu implementation trees *2300	0 / 0	(无)
	1472	P1380F Strange Addition data structures dp matrices *2600	0 / 0	(无)
	1471	P1380G Circular Dungeon greedy math probabilities *2600	0 / 0	(无)
	1470	P1381A1 Prefix Flip (Easy Version) constructive algorithms data structures strings *1300	0 / 0	(无)
	1469	P1381A2 Prefix Flip (Hard Version) constructive algorithms data structures implementation strings two pointers *1700	0 / 0	(无)
	1468	P1381B Unmerge dp *1800	0 / 0	(无)
	1467	P1381C Mastermind constructive algorithms graph matchings greedy implementation sortings two pointers *2500	0 / 0	(无)
	1466	P1381D The Majestic Brown Tree Snake dfs and similar dp greedy trees two pointers *3000	0 / 0	(无)

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