Codeforces Round #643 (Div. 2)
题目传送门 还是视频题解。 我在这简单说一下D和F吧。 关于D题的证明： 我们首先如下构造： \(1\ 1\ 1\cdots s-(n-1)\) 如果\(n-1<s-(n-1)-1\)显然存 ...
原文：Codeforces Round #643 (Div. 2) B. Young Explorers（贪心）
Young wilderness explorers set off to their first expedition led by senior explorer Russell. Explorers went into a forest, set up a camp and decided to split into groups to explore as much interesting ...
2020-05-16 23:15 0 640 推荐指数：
相关推荐
Codeforces Round #599 (Div. 1) B. 0-1 MST 图论
D. 0-1 MST Ujan has a lot of useless stuff in his drawers, a considerable part of which are his mat ...
Codeforces Round #626 （Div. 2） B. Count Subrectangles
题目连接：https://codeforces.com/contest/1323/problem/B 题意：给一个大小为n的a数组，一个大小为m的b数组，c数组是二维数组c[i][j]=a[i]*b[j]，问面积为k的矩形有几个。 题解：先把k的所有因子存入一个数组里，然后遍历因子，表示 ...
Codeforces Round #694 (Div. 2) B. Strange List
B. Strange List 题目分析 题意：给你一个长度为n的数组和一个数字x，从第一个元素开始，如果改元素q能被x整除，那么将就在数组后面新增x个(q / x)，直到遇到的元素不能被x整除，求最后数组的元素之和 让我们从样例开始入手分析：样例中的第一个情况数组a为[12]，x为2，数组 ...
Codeforces Round #661 (Div. 3) B. Gifts Fixing（思维）
You have n gifts and you want to give all of them to children. Of course, you don't want to offend a ...
Codeforces Round #327 (Div. 2) B. Rebranding C. Median Smoothing
B. Rebranding The name of one small but proud corporation consists of n lowercase ...
Codeforces Round #333 (Div. 1) B. Lipshitz Sequence 倍增 二分
B. Lipshitz Sequence Time Limit: 20 Sec Memory Limit: 256 MB 题目连接 http://codeforces.com/contest/601/problem/B Description A function is called ...
Codeforces Round #603 (Div. 2) B. PIN Codes 水题
B. PIN Codes A PIN code is a string that consists of exactly 4 digits. Examples of possible PIN codes: 7013, 0000 and 0990. Please note that the PIN ...