*1900 - 题库 - 机智小童

ID	题目显示标签隐藏标签	AC / 尝试	难度
765	codeforces#P93B End of Exams greedy *1900	0 / 0	(无)
1121	codeforces#P232B Table bitmasks combinatorics dp math *1900	0 / 0	(无)
1123	codeforces#P535C Tavas and Karafs binary search greedy math *1900	0 / 0	(无)
1030	codeforces#P685B Kay and Snowflake data structures dfs and similar dp trees *1900	0 / 0	(无)
457	codeforces#P700A As Fast As Possible binary search math *1900	0 / 0	(无)
1056	codeforces#P862C Mahmoud and Ehab and the xor constructive algorithms *1900	0 / 0	(无)
1244	codeforces#P894C Marco and GCD Sequence constructive algorithms math *1900	0 / 0	(无)
963	963 Array Without Local Maximums dp *1900	0 / 0	(无)
913	codeforces#P1067A Array Without Local Maximums dp *1900	0 / 0	(无)
1008	codeforces#P1220D Alex and Julian bitmasks math number theory *1900	0 / 0	(无)
1143	codeforces#P1428D Bouncing Boomerangs constructive algorithms greedy implementation *1900	0 / 0	(无)
1062	codeforces#P1479B1 Painting the Array I constructive algorithms data structures dp greedy implementation *1900	0 / 0	(无)
1184	codeforces#P1702G1 Passable Paths (easy version) dfs and similar trees *1900	0 / 0	(无)
1080	codeforces#P1955G GCD on a grid brute force dfs and similar dp implementation math number theory *1900	0 / 0	(无)

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

分类