数位DP
twh233
嘻嘻
展开
-
数位DP 思维起步
typedef long long ll; int a[20]; ll dp[20][state];//不同题目状态不同 ll dfs(int pos,/*state变量*/,bool lead/*前导零*/,bool limit/*数位上界变量*/)//不是每个题都要判断前导零 { //递归边界,既然是按位枚举,最低位是0,那么pos==-1说明这个数我枚举完了原创 2017-07-24 21:57:23 · 355 阅读 · 0 评论 -
hdu 3709 力矩
传送门Balanced NumberTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others) Total Submission(s): 965 Accepted Submission(s): 404 Problem Descr原创 2017-07-24 22:09:54 · 201 阅读 · 0 评论 -
hdu 3652 13倍数
传送门转自:这里Problem Description A 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 2原创 2017-07-24 22:05:27 · 198 阅读 · 0 评论 -
CF 55D 离散化各个位数的倍数
传送门D. Beautiful numberstime limit per test 4 secondsmemory limit per test 256 megabytesinput standard inputoutput standard outputVolodya is an odd boy原创 2017-07-24 22:27:19 · 292 阅读 · 0 评论 -
FZU 2109 奇偶
传送门One integer number x is called "Mountain Number" if:(1) x>0 and x is an integer;(2) Assume x=a[0]a[1]...a[len-2]a[len-1](0≤a[i]≤9, a[0] is positive). Any a[2i+1] is larger or equal原创 2017-07-24 22:24:10 · 364 阅读 · 2 评论 -
hdu 4352 状态压缩+数位DP
传送门XHXJ's LISTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2951 Accepted Submission(s): 1228Problem Description原创 2017-07-26 13:55:03 · 324 阅读 · 0 评论 -
hdu 6148 数位DP(板子 递增递减
传送门Valley NumerTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 431 Accepted Submission(s): 227Problem Description众所周知,度原创 2017-08-19 22:40:33 · 610 阅读 · 0 评论 -
Manthan, Codefest 17 E. Salazar Slytherin's Locket(数位DP)(进制)
传送门题意:给你b,l,r,问你l到r在b进制中有多少个数是每一个数字都是偶数个。做法:- - 数位dp很明显啊。dp[b][sta][c] 表示在b进制下,sta表示0 1状态, 1是偶数,0是奇数状态。c表示1-10的个数。 qd表示不一直都是0 。小技巧:之后只判是奇数还是偶数,所以中途用^处理。每次记得回溯。//china no.1#pragma原创 2017-09-27 21:17:25 · 536 阅读 · 0 评论