*3200 - 题库 - Boyacoding

ID	题目显示标签隐藏标签	AC / 尝试	难度
574	P1656G Cycle Palindrome constructive algorithms graphs math *3200	0 / 0	10
573	P1656H Equal LCM Subsets data structures math number theory *3200	0 / 0	10
501	P1666K Kingdom Partition flows *3200	0 / 0	10
464	P1672G Cross Xor constructive algorithms graphs math matrices *3200	0 / 0	10
274	P1704H1 Game of AI (easy version) combinatorics constructive algorithms dp fft math *3200	0 / 0	10
233	P1712F Triameter binary search data structures dfs and similar trees *3200	0 / 0	10
37	P1746E2 Joking (Hard Version) dp interactive *3200	0 / 0	10
8253	P1774G Segment Covering brute force combinatorics constructive algorithms data structures dp trees *3200	0 / 0	10
8279	P1781G Diverse Coloring constructive algorithms trees *3200	0 / 0	10
8278	P1781H1 Window Signals (easy version) *3200	0 / 0	10
8451	P1810G The Maximum Prefix dp *3200	0 / 0	10
8607	P1859F Teleportation in Byteland data structures dfs and similar divide and conquer graphs shortest paths trees *3200	0 / 0	10
8712	P1861F Four Suits binary search bitmasks flows greedy *3200	0 / 0	10
9118	P1951H Thanos Snap binary search dp games greedy trees *3200	0 / 0	10
9117	P1951I Growing Trees binary search constructive algorithms flows graphs greedy *3200	0 / 0	10
9240	P1958J Necromancer special problem 3200	0 / 0	10
9284	P1984G Magic Trick II constructive algorithms implementation sortings *3200	0 / 0	10

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

分类