Codeforces Round #787 (Div. 3) 全题解


源代码:ACM/OpenjudgeNow/Codeforces at master · abmcar/ACM (github.com)更好的阅读体验: Educational Codeforces Round 125 (Rated for Div. 2) (A-D题解) - Abmcar's 茶水间

Codeforces Round #780 (Div. 3) (全题解)


源代码:ACM/OpenjudgeNow/Codeforces at master · abmcar/ACM (github.com)(头一次知道全A是绿色的A. Vasya and Coins题目大意:思路:思考如果没有1硬币,则只能支付2的倍数的金额,1无法支付若有一个1硬币和无限2硬币,则任意

Educational Codeforces Round 125 (Rated for Div. 2) (A-D题解)


源代码:ACM/OpenjudgeNow/Codeforces at master · abmcar/ACM (github.com)A. Integer Moves题目大意:思路:可以知道最多只需要执行2次,一次移动横坐标,一次移动纵坐标而当$\sqrt{x2+y2}$为整数时 只需要一次操作即可

Codeforces Round #778 (Div. 1 + Div. 2, based on Technocup 2022 Final Round) (A-C题解)


源代码:ACM/OpenjudgeNow/Codeforces at master · abmcar/ACM (github.com)更好的阅读体验: Codeforces Round #776 (Div. 3) (A-E题解) - Abmcar's 茶水间A. Maximum Cake Tasti

Codeforces Round #776 (Div. 3) (A-E题解)


源代码:ACM/OpenjudgeNow/Codeforces at master · abmcar/ACM (github.com)更好的阅读体验: 折跃坐标A. Deletions of Two Adjacent Letters题目大意:思路:题目给出了最终剩下的字母,那么我们可以判断该字母在原

Educational Codeforces Round 124 (Rated for Div. 2) (A-D题解)


源代码:ACM/OpenjudgeNow/Codeforces at master · abmcar/ACM (github.com)更好的阅读体验: 折跃坐标A. Playoff题目大意:思路:比较简单的数学思路我们发现每轮会刷掉奇数位的选手不难发现和证明 最终剩下的一定是$2^n-1 $代码:v

Codeforces Round #777 (Div. 2) (A-D题解)


源代码:ACM/OpenjudgeNow/Codeforces at master · abmcar/ACM (github.com)更好的阅读体验: 折跃坐标碎碎念:不亏是俄罗斯场+二次元出题人,只能说头像越粉出题越狠A. Madoka and Math Dad题目大意:思路:我们可以发现对于没有

Educational Codeforces Round 123 (Rated for Div. 2) (A-D题解)


源代码:ACM/OpenjudgeNow/Codeforces at master · abmcar/ACM (github.com)更好的阅读体验: 折跃坐标A. Doors and Keys题目大意:思路:把当前得到的钥匙数存起来判断即可,可以使用isupper()和map简化代码:void s

Codeforces Round #772 (Div. 2) (A-D题解)


源代码:ACM/OpenjudgeNow/Codeforces at master · abmcar/ACM (github.com)A. Min Or Sum题目大意:思路:a+b >= a|b,我们可以把a,b换成0,a|b,这种形式,最终,我们可以把数组替换为若干个0和一个数组|和最终的

Codeforces Round #771 (Div. 2) (A-D题解)


源代码:ACM/OpenjudgeNow/Codeforces at master · abmcar/ACM (github.com)A. Reverse题目大意:思路:已知数组为一个排列,那么最优情况应该是1,2,3,4,5,6这种如果i != nums[i] 不难发现把nums[i]换为i应该是