数位DP
文章平均质量分 77
无
旺 崽
这个作者很懒,什么都没留下…
展开
-
Codeforces Beta Round #51 D. Beautiful numbers
题目链接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 beautiful numb原创 2021-05-14 10:01:05 · 1927 阅读 · 0 评论 -
HDUOJ 3652 B-number
题目链接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-numbers, but 143 and 2639 are not. Your task is to calculat原创 2021-05-13 21:28:52 · 1913 阅读 · 0 评论 -
HDUOJ 3555 Bomb
题目链接Problem DescriptionThe 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-sequence “49”, th原创 2021-05-13 20:54:27 · 1965 阅读 · 0 评论 -
CSP 201312-4 有趣的数
题目链接典型的数位DP~打表易发现所有符合条件的数都是以 222 开头的,那么一共有以下几种状态:只包含数字 2只包含数字 2,0只包含数字 2,3只包含数字 2,0,3只包含数字 2,0,1包含四个数字回答几个困惑,如果开头为 2,其他数字任选,那为什么不是 23=82^3=823=8 个状态呢?举例,为什么没有只包含 2,1的状态,因为 1 的位置必须出现在 0 后面,如果单纯只有 2,1 显然无法知道答案,所以出现 1 就必须出现 0,所以只有 6 个状态。我们用 dp[i][原创 2021-04-01 16:32:57 · 1924 阅读 · 0 评论