![](https://img-blog.csdnimg.cn/20201014180756930.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
动态规划
文章平均质量分 90
mousehao001
这个作者很懒,什么都没留下…
展开
-
LightOJ 1422 Halloween Costumes (区间dp)
1422 - Halloween Costumes PDF (English)StatisticsForumTime Limit: 2 second(s)Memory Limit: 32 MBGappu has a very busy weekend ahead of him. Beca原创 2015-07-10 19:30:53 · 757 阅读 · 0 评论 -
poj 2955
BracketsTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 3961 Accepted: 2085DescriptionWe give the following inductive definition of a “regular brackets”原创 2015-07-10 19:52:05 · 606 阅读 · 0 评论 -
codeforces 149d Coloring Brackets
Coloring Bracketstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputOnce Petya read a problem about a bracket sequence. H原创 2015-07-10 20:00:29 · 534 阅读 · 0 评论 -
数位dp专辑
1.题目链接:codeforces 55D【题意】一个数能被它每一位的数字整除(0除外)则为beautiful number ,问[l,r]之间有多少个这样的数【思路】考虑到每一位的数字只能是1,2,,9,最小公倍数为2520. 设数w=x*2520+y,每位数字的最小公倍数为mul,则w%mul=(x*2520+y)%mul=x*2520%mul+y%mul=y%mul原创 2015-07-17 18:02:21 · 494 阅读 · 0 评论