Codeforces - 题库 - 云斗学院

ID	题目显示标签隐藏标签	AC / 尝试	难度
1622	P1373C Pluses and Minuses math *1300	0 / 0	(无)
1621	P1373D Maximum Sum on Even Positions divide and conquer dp greedy implementation *1600	0 / 0	(无)
1620	P1373E Sum of Digits brute force constructive algorithms dp greedy *2200	0 / 0	(无)
1619	P1373F Network Coverage binary search constructive algorithms data structures greedy *2400	0 / 0	(无)
1618	P1373G Pawns data structures divide and conquer greedy *2600	0 / 0	(无)
1617	P1374A Required Remainder math *800	0 / 0	(无)
1616	P1374B Multiply by 2, divide by 6 math *900	0 / 0	(无)
1615	P1374C Move Brackets greedy strings *1000	0 / 0	(无)
1614	P1374D Zero Remainder Array math sortings two pointers *1400	0 / 0	(无)
1613	P1374E1 Reading Books (easy version) data structures greedy sortings *1600	0 / 0	(无)
1612	P1374E2 Reading Books (hard version) data structures greedy implementation sortings ternary search two pointers *2500	0 / 0	(无)
1611	P1374F Cyclic Shifts Sorting brute force constructive algorithms implementation sortings *2400	0 / 0	(无)
1610	P1375A Sign Flipping constructive algorithms math *1100	0 / 0	(无)
1609	P1375B Neighbor Grid constructive algorithms greedy *1200	0 / 0	(无)
1608	P1375C Element Extermination constructive algorithms data structures greedy *1400	0 / 0	(无)
1607	P1375D Replace by MEX brute force constructive algorithms sortings *1900	0 / 0	(无)
1606	P1375E Inversion SwapSort constructive algorithms greedy sortings *2500	0 / 0	(无)
1605	P1375F Integer Game constructive algorithms games interactive math *2600	0 / 0	(无)
1604	P1375G Tree Modification brute force constructive algorithms dfs and similar graph matchings graphs trees *2800	0 / 0	(无)
1603	P1375H Set Merging constructive algorithms divide and conquer *3300	0 / 0	(无)

试试手气

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

京ICP备2021032661号-1
京公网安备 11011102002149号
Powered by Hydro v5.0.0-beta.13

分类

动态规划

搜索

计算几何

贪心

树结构

图结构

数论

模拟

数据结构

博弈论

字符串

组合数学

线性代数

高精度

递推

概率论

NPC

其他

分类

还没有账户？

登录