数位dp
GAUSS_CLB
acm模板分享:https://github.com/gauss-clb/acm-algorithm-template
展开
-
hdu3709 Balanced Number
Balanced Number Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 1907 Accepted Submission(s): 851 Problem Description A balanced原创 2014-07-18 19:58:49 · 466 阅读 · 0 评论 -
数位dp--spoj1182
1182. Sorted bit squence Problem code: SORTBIT Let's consider the 32 bit representation of all integers i from m up to n inclusive (m ≤ i ≤ n; m × n ≥ 0, -2^31 ≤ m ≤ n ≤ 2^31-1). Not原创 2014-07-14 14:46:10 · 539 阅读 · 0 评论 -
数位dp题集
ural1057 论文题,b进制转二进制,按二进制数位dp,符合题意的应当满足每位为0或1,例如3*****,就相当于111111,因为2和3开头的数必然不满足条件,因此相当于区间[000000,111111]. #include #include #include using namespace std; int dp[40][30]; int tot,bit[40]; void chan原创 2015-07-18 13:11:34 · 475 阅读 · 0 评论