Codeforces Round #829B CF1753B Factorial Divisibility

问数组a,sum(a!)%(x!)==0

首先大于x的a无需考虑会被约掉

低于的可以逐渐合并 1!+1! = 2!

2!+2!+2!=3! 看能否合并成多个 x!

map计数统计/ sort一下从小到大扫一遍即可

实际上有个前提是合并剩余的部分一定会小于x! 比如 4! + 4! + 4! + 3! + 3! < 5!

因为5! = 4!+4!+4!+4!+4! > 4! +4! +4! + 4! + 3!+3! +3! + 2! + 2! + 1!

阶乘这种形式如果右侧大于5！了就一定能合成5!+ 的形式

Codeforces Round #829B CF1753B Factorial Divisibility相关推荐

Codeforces Round #829 (Div. 2) A~D
比赛链接:Dashboard - Codeforces Round #829 (Div. 2) - Codeforces 目录 A. Technical Support B. Kevin and Pe ...
Codeforces Round #297 (Div. 2)E. Anya and Cubes 折半搜索
Codeforces Round #297 (Div. 2)E. Anya and Cubes Time Limit: 2 Sec Memory Limit: 512 MB Submit: xxx ...
Codeforces Round #506 (Div. 3)
Codeforces Round #506 (Div. 3) 实习期间事不多,对div3 面向题解和数据编程了一波 A. Many Equal Substrings 题目链接 A题就是找后缀和前缀重合 ...
Codeforces Round #417：E. FountainsSagheer and Apple Tree（树上博弈）
Codeforces Round #417:E. FountainsSagheer and Apple Tree(树上博弈) 标签: codeforces 2017-06-02 11:41 29人阅读 ...
Codeforces Round #563 (Div. 2)/CF1174
Codeforces Round #563 (Div. 2)/CF1174 CF1174A Ehab Fails to Be Thanos 其实就是要\(\sum\limits_{i=1}^n a_i ...
Codeforces Round #270
Codeforces Round #270 题目链接 A:我是筛了下素数.事实上偶数仅仅要输出4和x - 4,奇数输出9和x - 9就可以 B:贪心的策略,把时间排序后.取每k个的位置 C:贪心.每次 ...
构造 Codeforces Round #302 (Div. 2) B Sea and Islands
题目传送门 1 /* 2 题意:在n^n的海洋里是否有k块陆地 3 构造算法:按奇偶性来判断,k小于等于所有点数的一半,交叉输出L/S 4 输出完k个L后,之后全部输出S:) 5 5 10 的例子可以 ...
[Educational Codeforces Round 16]A. King Moves
[Educational Codeforces Round 16]A. King Moves 试题描述 The only king stands on the standard chess board ...
Educational Codeforces Round 114 (Rated for Div. 2) （A ~ F）全题解
整理的算法模板合集: ACM模板点我看算法全家桶系列!!! 实际上是一个全新的精炼模板整合计划 Educational Codeforces Round 114 (Rated for Div. 2) ...

Codeforces Round #829B CF1753B Factorial Divisibility

Codeforces Round #829B CF1753B Factorial Divisibility相关推荐

最新文章

热门文章