题库 - fft - HydroOJ

	ID	题目显示标签隐藏标签	AC / 尝试	难度
	520	P1450H1 Multithreading (Easy Version) combinatorics fft math *2900	0 / 0	10
	401	P1473G Tiles combinatorics dp fft math *2800	0 / 0	10
	376	P1477F Nezzar and Chocolate Bars combinatorics fft math probabilities *3500	0 / 1	10
	368	P1479E School Clubs dp fft math number theory probabilities *3500	0 / 0	10
	330	P1487G String Counting combinatorics dp fft math *2700	0 / 0	10
	320	P1488J Flower Shop special problem data structures fft math 3100	0 / 0	10
	53	P1528F AmShZ Farm combinatorics fft math *3300	0 / 0	10
	22	P1536F Omkar and Akmar chinese remainder theorem combinatorics constructive algorithms fft games geometry math meet-in-the-middle string suffix structures *2600	0 / 0	10
	7218	P1548C The Three Little Pigs combinatorics dp fft math	0 / 0	(无)
	7170	P1553I Stairs combinatorics divide and conquer fft math	0 / 1	10
	7307	P1574F Occurrences combinatorics dp dsu fft graphs	0 / 0	(无)
	7323	P1580F Problems for Codeforces fft math *3300	0 / 0	10
	7516	P1613F Tree Coloring combinatorics fft	0 / 0	(无)
	7693	P1641E Special Positions brute force combinatorics divide and conquer fft math	0 / 0	(无)
	7684	P1644F Basis combinatorics fft math number theory	0 / 0	(无)
	7731	P1654H Three Minimums combinatorics fft math *3500	0 / 0	10
	7832	P1667E Centroid Probabilities combinatorics dp fft math *3000	0 / 0	(无)
	7815	P1671F Permutation Counting brute force combinatorics dp fft math *2700	0 / 0	(无)
	7945	P1687F Koishi's Unconscious Permutation fft math *3500	0 / 0	(无)
	8073	P1704G Mio and Lucky Array constructive algorithms fft math strings	0 / 0	(无)
	8072	P1704H1 Game of AI (easy version) combinatorics fft math	0 / 0	(无)
	8071	P1704H2 Game of AI (hard version) combinatorics fft math	0 / 0	(无)
	8065	P1709F Multiset of Strings bitmasks brute force dp fft flows graphs math meet-in-the-middle trees	0 / 0	(无)
	8163	P1726E Almost Perfect combinatorics fft math	0 / 0	(无)
	8459	P1731F Function Sum brute force combinatorics dp fft math *2500	0 / 0	9
	8421	P1770G Koxia and Bracket divide and conquer fft math	0 / 0	(无)
	8373	P1773G Game of Questions bitmasks combinatorics dp fft math probabilities *2800	0 / 0	10
	8495	P1792F2 Graph Coloring (hard version) brute force fft	0 / 0	(无)
	8598	P1794D Counting Factorizations combinatorics divide and conquer dp fft math number theory	0 / 0	(无)
	8647	P1808E3 Minibuses on Venus (hard version) brute force combinatorics dp fft math *2800	0 / 0	10
	8709	P1821F Timber combinatorics dp fft math	0 / 0	(无)
	8845	P1845F Swimmers in the Pool fft math number theory	0 / 0	(无)
	8938	P1856E2 PermuTree (hard version) bitmasks dfs and similar dp fft implementation trees	0 / 0	(无)
	9176	P1896H1 Cyclic Hamming (Easy Version) brute force divide and conquer dp fft math number theory	0 / 0	(无)
	9175	P1896H2 Cyclic Hamming (Hard Version) brute force dp fft math number theory	0 / 0	(无)
	9289	P1909I Short Permutation Problem combinatorics dp fft math *3500	0 / 0	10
	9227	P1912B Blueprint for Seating combinatorics divide and conquer fft math *2000	0 / 0	7
	9416	P1936E Yet Yet Another Permutation Problem divide and conquer fft math	0 / 0	(无)
	9515	P1942G Bessie and Cards combinatorics fft math	0 / 0	(无)
	9512	P1952B Is it stated? chinese remainder theorem fft strings	0 / 0	(无)
	9504	P1952J Help, what does it mean to be "Based" 2-sat chinese remainder theorem fft geometry hashing implementation interactive schedules sortings string suffix structures	0 / 0	(无)
	9571	P1967E1 Again Counting Arrays (Easy Version) combinatorics dp fft math	0 / 0	(无)

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