Codeforces - 1166C - A Tale of Two Lands
Codeforces - 1166C - A Tale of Two Lands地址http://codeforces.com/contest/1166/problem/C原文地址https://www.lucien.ink/archives/432题目The legend of the foundation of Vectorland talks of two integers $x$ a...
Codeforces - 1166C - A Tale of Two Lands地址http://codeforces.com/contest/1166/problem/C原文地址https://www.lucien.ink/archives/432题目The legend of the foundation of Vectorland talks of two integers $x$ a...
Codeforces - 1166B - All the Vowels Please地址http://codeforces.com/contest/1166/problem/B原文地址https://www.lucien.ink/archives/431题目Tom loves vowels, and he likes long words with many vowels. His favo...
Codeforces - 1166A - Silent Classroom地址http://codeforces.com/contest/1166/problem/A原文地址https://www.lucien.ink/archives/430题目There are $n$ students in the first grade of Nlogonia high school. The pr...
题目链接http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemId=6022原文地址https://www.lucien.ink/archives/427/题意一维坐标轴上有 $n$ 条线段,你可以在每个线段的整点上放任意多个标记,但是任意两个标记不能重合,问最多有多少条线段可以拥有标记。题解思路最原始的想法是二分图,但看了眼范围放弃...
地址https://codeforces.com/contest/1152/problem/C原文地址https://www.lucien.ink/archives/423/题意给你 $a$ 和 $b$ ,找到一个最小的 $k$ ,使得 $lcm(a + k, b + k)$ 最小。题解不妨设 $a > b$ ,则有:枚举 $a - b$ 的所有因子即可。代码https://paste...