博客园

随笔分类 -  数位dp

记忆化或者经典三重循环
1049 Counting Ones (30 分)（数位dp的记忆化搜索）
摘要：题目描述: 1049 Counting Ones (30 分) The task is simple: given any positive integer N, you are supposed to count the total number of 1's in the decimal for 阅读全文
posted @ 2021-03-11 19:37 cono奇犽哒 阅读(64) 评论(0) 推荐(0)
hdu3652(数位dp模板)
摘要：问题描述:求1-n内的数中包含49的数的个数,数位dp模板 代码: #include<iostream> #include<string.h> #include<cmath> #include<set> #include<map> #include<string> #include<queue> # 阅读全文
posted @ 2021-03-06 11:21 cono奇犽哒 阅读(50) 评论(0) 推荐(0)
hdu3652(数位dp,记忆化搜索)
摘要：题目描述: B-number Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 12235 Accepted Submission(s): 732 阅读全文
posted @ 2021-03-06 10:46 cono奇犽哒 阅读(115) 评论(0) 推荐(0)