Codeforces - 1166E - The LCMs Must be Large
Codeforces - 1166E - The LCMs Must be Large地址http://codeforces.com/contest/1166/problem/E原文地址https://www.lucien.ink/archives/434题目Dora the explorer has decided to use her money after several years ...
Codeforces - 1166E - The LCMs Must be Large地址http://codeforces.com/contest/1166/problem/E原文地址https://www.lucien.ink/archives/434题目Dora the explorer has decided to use her money after several years ...
Codeforces - 1166D - Cute Sequences地址http://codeforces.com/contest/1166/problem/D原文地址https://www.lucien.ink/archives/433题目Given a positive integer $m$, we say that a sequence $x_1, x_2, \dots, x_n$...
题目链接http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=6022原文地址https://www.lucien.ink/archives/427/题意一维坐标轴上有 $n$ 条线段,你可以在每个线段的整点上放任意多个标记,但是任意两个标记不能重合,问最多有多少条线段可以拥有标记。题解思路最原始的想法是二分图,但看了眼范围放弃...
地址https://codeforces.com/contest/1152/problem/B原文地址https://www.lucien.ink/archives/422/题意给你一个 $x$ ,让你在 $40$ 步之内把它变成 $2 ^ n - 1$ 的形式,你一定会在奇数步将其异或上一个值 $2 ^ k - 1$ ,在偶数步将其自增 $1$ ,让你输出你需要花多少步,以及每次奇数步时的...
地址https://codeforces.com/contest/1152/problem/A原文地址https://www.lucien.ink/archives/421/题意有 $n$ 把锁 $m$ 把钥匙,如果锁 $A$ 和钥匙 $B$ 的权值加起来是一个奇数,那么 $A$ 和 $B$ 就可以配对,问最多能配多少对。代码https://pasteme.cn/6825#include &...