![](https://img-blog.csdnimg.cn/20200729090945935.jpg?x-oss-process=image/resize,m_fixed,h_224,w_224)
动态规划之数位dp
平时做到动态规划写的题解与代码(用来加深记忆)
kitalekita
如果你觉得自己很菜,请你努力,因为你不努力更菜
展开
-
F(x)(数位dp之提高题)(自己认为)
HDU 4734 F(x) Problem Description For a decimal number x with n digits (AnAn-1An-2 … A2A1), we define its weight as F(x) = An * 2n-1 + An-1 * 2n-2 + … + A2 * 2 + A1 * 1. Now you are given two numbers A and B, please calculate how many numbers are there bet原创 2020-07-29 13:05:45 · 235 阅读 · 0 评论 -
数位dp 之 不要62(数位dp入门题)
数位dp 之 不要62(数位dp入门题) HDU-2089 不要62 Problem Description 杭州人称那些傻乎乎粘嗒嗒的人为62(音:laoer)。 杭州交通管理局经常会扩充一些的士车牌照,新近出来一个好消息,以后上牌照,不再含有不吉利的数字了,这样一来,就可以消除个别的士司机和乘客的心理障碍,更安全地服务大众。 不吉利的数字为所有含有4或62的号码。例如: 62315 73418 88914 都属于不吉利号码。但是,61152虽然含有6和2,但不是62连号,所以不属于不吉利数字之列。 你的原创 2020-07-23 20:19:06 · 550 阅读 · 0 评论 -
数位dp 之beautiful numbers(kuangbin带我飞之数位dp)
kuangbin带我飞之数位dp A题 Volodya is an odd boy and his taste is strange as well. It seems to him that a positive integer number is beautiful if and only if it is divisible by each of its nonzero digits. We will not argue with this and just count the quantity of原创 2020-07-28 19:59:32 · 133 阅读 · 0 评论 -
Bomb(数位dp入门题)
HDU 3555-----Bomb Problem Description The counter-terrorists found a time bomb in the dust. But this time the terrorists improve on the time bomb. The number sequence of the time bomb counts from 1 to N. If the current number sequence includes the sub-sequ原创 2020-07-28 20:31:33 · 222 阅读 · 0 评论 -
HDU 4722 Good Numbers(数位dp基础题)
HDU 4722 Good Numbers Problem Description If we sum up every digit of a number and the result can be exactly divided by 10, we say this number is a good number. You are required to count the number of good numbers in the range from A to B, inclusive. Input原创 2020-07-28 22:33:28 · 143 阅读 · 0 评论