动态规划-数位DP
Dave_L
这个作者很懒,什么都没留下…
展开
-
HDU2089 数位DP 模板题
不要62Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 44774 Accepted Submission(s): 16663Problem Description杭州人称那些傻乎乎粘嗒嗒的人为62(音:lao原创 2017-08-11 14:55:18 · 364 阅读 · 0 评论 -
Educational Codeforces Round 50 (Rated for Div. 2) A 数学 B数学 C数位DP D双指针模拟
A Code:#include <bits/stdc++.h>#define LL long long using namespace std;int main(){ LL n , k ; cin >> n >> k ; n = 2 * n + 1 ; n -- ; n /= 2 ; LL ...原创 2018-09-12 22:31:59 · 152 阅读 · 0 评论 -
Dp练习 -Sakura数 简单数位DP
思路:简单数位DP,dp[pos][pre]表示枚举到pos位时前一位为pre。 考虑前导0以及数据范围自然溢出。Code:#include <bits/stdc++.h>#define LL unsigned long longusing namespace std;const int AX = 20+2;int a[AX];LL dp[AX][15];L...原创 2018-06-29 20:35:44 · 225 阅读 · 0 评论 -
Codeforces 913 A 模拟 B模拟 C 贪心+位运算 D 优先队列+枚举 (补题)
A. Modular Exponentiationtime limit per test1 secondmemory limit per test256 megabytesinputstandard inputoutputstandard outputThe following problem is well-known: given i原创 2018-01-11 16:05:20 · 696 阅读 · 0 评论 -
51nod 1043 幸运号码
1043 幸运号码基准时间限制:1 秒 空间限制:131072 KB 分值: 20 难度:3级算法题 收藏 关注1个长度为2N的数,如果左边N个数的和 = 右边N个数的和,那么就是一个幸运号码。例如:99、1230、123312是幸运号码。给出一个N,求长度为2N的幸运号码的数量。由于数量很大,输出数量 Mod 10^9 + 7的结果即可。原创 2017-10-01 11:25:18 · 349 阅读 · 0 评论 -
HDU 4507 吉哥系列故事――恨7不成妻 数位DP
吉哥系列故事——恨7不成妻Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)Total Submission(s): 4531 Accepted Submission(s): 1480Problem Description 单身! 依然单身!原创 2017-08-24 14:43:38 · 365 阅读 · 0 评论 -
Balanced Numbers 数位DP+3进制压缩
Balanced numbers have been used by mathematicians for centuries. A positive integer is considered a balanced number if:1) Every even digit appears an odd number of times in its decimal represen原创 2017-08-22 17:30:17 · 395 阅读 · 0 评论 -
hdu 3555 数位DP
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 inc原创 2017-08-22 17:37:51 · 410 阅读 · 0 评论 -
HDU3652 B-number 数位DP
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 2613 are wqb-numbers, but 143 and 2639 ar原创 2017-08-22 17:35:53 · 253 阅读 · 0 评论 -
51nod 1042 数字0-9的数量 数位DP
1042数字0-9的数量基准时间限制:1 秒 空间限制:131072 KB 分值:10难度:2级算法题 收藏 关注 取消关注给出一段区间a-b,统计这个区间内0-9出现的次数。比如 10-19,1出现11次(10,11,12,13,14,15,16,17,18,19,其中11包括2个1),其余数字各出现1次。Input原创 2017-08-22 17:26:59 · 367 阅读 · 0 评论 -
POJ3252 数位DP Round Numbers
Round NumbersTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 14014Accepted: 5564DescriptionThe cows, as you know, have no finge原创 2017-08-21 16:18:30 · 323 阅读 · 0 评论 -
HDU 4734 数位DP
F(x)Time Limit: 1000/500 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6185 Accepted Submission(s): 2364Problem DescriptionFor a decimal number x wit原创 2017-08-21 16:14:10 · 204 阅读 · 0 评论 -
Codeforces Beta Round #51 D 数位DP
D. Beautiful numberstime limit per test4 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputVolodya is an odd boy and his taste is strange a原创 2017-08-20 18:43:38 · 337 阅读 · 0 评论 -
Educational Codeforces Round 53 (Rated for Div. 2) A 思维 B模拟 C二分 +尺取 D暴力 E数位dp+二进制压缩
A思路:找出最简单的2个长度的情况就行。Code:#include &lt;bits/stdc++.h&gt;using namespace std;int main(){ string s ; int n ; cin &gt;&gt; n ; cin &gt;&gt; s ; for( int i = 0 ; i &lt; n - 1 ; i++ ){ if( s原创 2018-11-15 22:01:26 · 206 阅读 · 0 评论