cf
xiaohuihuicb
分享快乐
展开
-
CodeForces - 448D—Multiplication Table--二分法(nlogn)
Description Bizon the Champion isn't just charming, he also is very smart. While some of us were learning the multiplication table, Bizon the Champion had fun in his own manner. Bizon the Champion原创 2015-08-01 00:17:49 · 1242 阅读 · 0 评论 -
Codeforces Round #338 (Div. 2)
Codeforces Round #338 (Div. 2)原创 2016-01-09 17:55:48 · 468 阅读 · 0 评论 -
Multipliers codeforces -费马小定理
http://codeforces.com/contest/615/problem/D Ayrat has number n, represented as it's prime factorization pi of size m, i.e. n = p1·p2·...·pm. Ayrat got secret information that that the pro原创 2016-01-09 20:08:24 · 1281 阅读 · 0 评论 -
dp专题
codeforces 687C The Values You Can Make 题意: 给n枚硬币,和一个数k。求能够组成总和为k的全部子集的子集能够组成的数字可以是多少。 样例: 输入: 3 50 25 25 50 输出: 3 0 25 50 很普通的dp。 dp[i][j][y]表示前 i 个硬币是否能够有能够组成总和为j的子原创 2016-07-03 20:35:03 · 560 阅读 · 0 评论