数位DP
morejarphone
这个作者很懒,什么都没留下…
展开
-
数位DP 水~
数位DP貌似很弱,先切水的练练手~HDU2089:点击打开链接输出区间里面没有连续62,没有4的数字个数.#include using namespace std;long long n, m;int bit[11], l;int dp[11][2];int dfs (int pos, bool f1, bool f2) {//当前的位数 前一个数是不是6 是不是可以取到原创 2016-04-05 18:41:38 · 386 阅读 · 0 评论 -
HDU 4507 (数位DP)
吉哥系列故事——恨7不成妻Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 2758 Accepted Submission(s): 829Problem Description 单身! 依然单身!原创 2016-04-05 23:29:54 · 392 阅读 · 0 评论 -
HDU 4734 (数位DP)
F(x)Time Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3315 Accepted Submission(s): 1247Problem DescriptionFor a decimal number x原创 2016-04-06 18:32:41 · 274 阅读 · 0 评论 -
HDU 4722 (数位DP 水~)
Good NumbersTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 3814 Accepted Submission(s): 1213Problem DescriptionIf we sum up every digit of a原创 2016-04-06 18:44:49 · 357 阅读 · 0 评论 -
HDU 3652 (数位DP 水~)
Problem DescriptionA wqb-number, or B-number for short, is a non-negative integer whose decimal form contains the sub- string "13" and can be divided by 13. For example, 130 and 2613 are wqb-numbe原创 2016-04-08 11:00:02 · 279 阅读 · 0 评论 -
hihocoder 1259 (数位DP)
连接:点击打开链接题意:定义g(x)为f(1)到f(n)中模k余n的个数,求出所有g(x)的异或和.坑爹UVA一直报RE然后转向hihocoder就过了~f(2x)=3f(x),f(2x+1)=f(2x)+1.然后发现f(1)到f(n)在三进制下等价于二进制下的1到n,然后就可以用数位DP搞了.这个思想下的转移方程dp(d,m) = dp(d-1, (m-x)%k).#in原创 2016-04-10 21:38:23 · 512 阅读 · 0 评论 -
HDU 3943 (二分+数位DP)
K-th Nya NumberTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 125536/65536 K (Java/Others)Total Submission(s): 2762 Accepted Submission(s): 869Problem DescriptionArcueid li原创 2016-04-10 23:07:15 · 368 阅读 · 0 评论