
cf补全计划
文章平均质量分 88
zengyz-wh
退役ACMer,零基础学NLP中
展开
-
Codeforces Round #792 (Div. 1 + Div. 2)
A. Digit Minimization There is an integer n without zeros in its decimal representation. Alice and Bob are playing a game with this integer. Alice starts first. They play the game in turns. On her turn, Alice must swap any two digits of the integer that ar原创 2022-05-21 00:11:23 · 409 阅读 · 0 评论 -
Codeforces Round #785 (Div. 2) A-D
A. Subtle Substring Subtraction 给你一个字符串,Alice先手并取偶数长度的子串,Bob后手并取奇数长度的子串,问取完整个字符串谁的值最大,差值是多少 易知Alice一定会取最长的偶数子串,先特判一下字符串长度为1时Bob赢 然后如果是偶数长度就直接取完,否则判断一下第一个字符和最后一个字符谁大,留一个小的给Bob剩下的全部取完就行 /**************** *@description:for the Escape Project *@author: Nebul原创 2022-05-01 11:23:51 · 328 阅读 · 0 评论