Codeforces - 题库 - 云斗学院

ID	题目显示标签隐藏标签	AC / 尝试	难度
6696	P238A Not Wool Sequences constructive algorithms math *1300	0 / 0	(无)
6695	P238B Boring Partition constructive algorithms *1800	0 / 0	(无)
6694	P238C World Eater Brothers dfs and similar dp greedy trees *2100	0 / 0	(无)
6693	P238D Tape Programming data structures implementation *2900	0 / 0	(无)
6692	P238E Meeting Her dp graphs shortest paths *2600	0 / 0	(无)
6691	P239A Two Bags of Potatoes greedy implementation math *1200	0 / 0	(无)
6690	P239B Easy Tape Programming brute force implementation *1500	0 / 0	(无)
6689	P240E Road Repairs dfs and similar graphs greedy *2800	0 / 0	(无)
6688	P240F TorCoder data structures *2600	0 / 1	10
6687	P241A Old Peykan greedy *1300	0 / 0	(无)
6686	P241B Friends binary search bitmasks data structures math *2700	0 / 0	(无)
6685	P241C Mirror Box geometry implementation *2000	0 / 0	(无)
6684	P241D Numbers *2900	0 / 0	(无)
6683	P241E Flights graphs shortest paths *2600	0 / 0	(无)
6682	P241F Race brute force implementation *2300	0 / 0	(无)
6681	P241G Challenging Balloons constructive algorithms *1900	0 / 0	(无)
6680	P242A Heads or Tails brute force implementation *1100	0 / 0	(无)
6679	P242B Big Segment implementation sortings *1100	0 / 0	(无)
6678	P242C King's Path dfs and similar graphs hashing shortest paths *1800	0 / 0	(无)
6677	P242D Dispute dfs and similar graphs greedy *2100	0 / 0	(无)

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

分类