Codeforces - 题库 - 云斗学院

ID	题目显示标签隐藏标签	AC / 尝试	难度
7256	P110A Nearly Lucky Number implementation *800	0 / 0	(无)
7255	P110B Lucky String constructive algorithms strings *1100	0 / 0	(无)
7254	P111A Petya and Inequiations greedy *1400	0 / 0	(无)
7253	P111B Petya and Divisors binary search data structures number theory *1900	0 / 0	(无)
7252	P111C Petya and Spiders bitmasks dp dsu *2100	0 / 0	(无)
7251	P111D Petya and Coloring combinatorics dp *2300	0 / 0	(无)
7250	P111E Petya and Rectangle *2900	0 / 0	(无)
7249	P112A Petya and Strings implementation strings *800	0 / 0	(无)
7248	P112B Petya and Square implementation math *1200	0 / 0	(无)
7247	P113A Grammar Lessons implementation strings *1600	0 / 0	(无)
7246	P113B Petr# brute force data structures hashing strings *2000	0 / 0	(无)
7245	P113C Double Happiness brute force math number theory *2200	0 / 0	(无)
7244	P113D Museum math matrices probabilities *2700	0 / 0	(无)
7243	P113E Sleeping combinatorics implementation math *2700	0 / 0	(无)
7242	P114A Cifera math *1000	0 / 0	(无)
7241	P114B PFAST Inc. bitmasks brute force graphs *1500	0 / 0	(无)
7240	P115A Party dfs and similar graphs trees *900	0 / 0	(无)
7239	P115B Lawnmower greedy sortings *1500	0 / 0	(无)
7238	P115C Plumber math *2200	0 / 0	(无)
7237	P115D Unambiguous Arithmetic Expression dp expression parsing *2600	0 / 0	(无)

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

分类