数位dp
AC之路有笑有泪
搞ACM挺好的,就是头有点冷。
展开
-
HDU - 3652 B-number(数位dp详解)
数位dp 至少要会两个基础题目,再做这道题才较容易。https://cn.vjudge.net/problem/CodeForces-55D (kuangbin数位dp A题)https://blog.csdn.net/wust_zzwh/article/details/52100392 (kuangbin数位dp C题)数位dp入门(不要62)推荐,剩下的进阶版实在是本人能力有限,...原创 2018-05-29 21:54:38 · 1265 阅读 · 0 评论 -
POJ - 3252 E - Round Numbers (数位dp)
https://cn.vjudge.net/problem/POJ-3252 Round Numbers The cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone' (also known as 'Rock, Paper, Scissors',...原创 2018-05-30 11:25:50 · 241 阅读 · 0 评论 -
F - Balanced Number HDU - 3709 数位dp
F - Balanced Number HDU - 3709 https://cn.vjudge.net/problem/HDU-3709A balanced number is a non-negative integer that can be balanced if a pivot is placed at some digit. More specifically, imagine eac...原创 2018-05-30 19:34:09 · 227 阅读 · 0 评论 -
K - Balanced Numbers SPOJ - BALNUM 数位dp+状压
K - Balanced Numbers SPOJ - BALNUM https://cn.vjudge.net/problem/SPOJ-BALNUMBalanced numbers have been used by mathematicians for centuries. A positive integer is considered a balanced number if:1) ...原创 2018-05-30 20:34:51 · 219 阅读 · 0 评论 -
51nod 1009 数字1的数量 (不用找规律的方法,用数位dp板子写这道题,以加深对数位dp的理解)
1009 数字1的数量 基准时间限制:1 秒 空间限制:131072 KB 分值: 5 难度:1级算法题 收藏 关注给定一个十进制正整数N,写下从1开始,到N的所有正数,计算出其中出现所有1的个数。例如:n = 12,包含了5个1。1,10,12共包含3个1,11包含2个1,总共5个1。Input输入N(1 <= N <= 10^9)Output输出包含1的个数Input示例12Ou...原创 2018-06-01 10:12:32 · 252 阅读 · 0 评论