设为首页 加入收藏

TOP

NYOJ-269 VF
2015-07-24 05:33:56 来源: 作者: 【 】 浏览:6
Tags:NYOJ-269

VF

时间限制:1000 ms | 内存限制:65535 KB 难度:2
描述
Vasya is the beginning mathematician. He decided to make an important contribution to the science and to become famous all over the world. But how can he do that if the most interesting facts such as Pythagor’s theorem are already proved? Correct! He is to think out something his own, original. So he thought out the Theory of Vasya’s Functions. Vasya’s Functions (VF) are rather simple: the value of the Nth VF in the point S is an amount of integers from 1 to N that have the sum of digits S. You seem to be great programmers, so Vasya gave you a task to find the milliard VF value (i.e. the VF with N = 109) because Vasya himself won’t cope with the task. Can you solve the problem?
输入
There are multiple test cases.
Integer S (1 ≤ S ≤ 81).
输出
The milliard VF value in the point S.
样例输入
1
样例输出
10


题意:输入一个数s,求1-10^9中,每个数的各位数字之和为s的数有几个

dp[i][j]表示前 j 位数字之和为 i 的情况的数量

当 i 〉1 时,假设第 j 位为 k ,那么前 j - 1 的和就是 i - k;

由此得出状态转移方程dp[i][j]=dp[i][j]+dp[i-k][j-1];


01. #include 02. using namespace std; 03. int dp[85][15]; 04. int main() 05. { 06. for ( int i=0;i<10;i++) 07. dp[0][i]=1; 08. for ( int i=1;i<82;i++) 09. for ( int j=1;j<10;j++) //前j位之和为i 10. for ( int k=0;k<10&&i-k>=0;k++) //第j位为k,使前j-1位为i-k 11. if (dp[i-k][j-1]) //如果前面的数字能组合成i-k 12. dp[i][j]+=dp[i-k][j-1]; 13. int s; 14. while (cin>>s) 15. { 16. if (s==1) 17. cout<<10< 18. else 19. cout< 20. } 21. return 0; 22. }

<script type="text/java script">
<script type="text/java script">BAIDU_CLB_fillSlot("771048");
点击复制链接 与好友分享! 回本站首页
<script> function copyToClipBoard(){ var clipBoardContent=document.title + '\r\n' + document.location; clipBoardContent+='\r\n'; window.clipboardData.setData("Text",clipBoardContent); alert("恭喜您!复制成功"); }
<script>window._bd_share_config={"common":{"bdSnsKey":{},"bdText":"","bdMini":"2","bdMiniList":false,"bdPic":"","bdStyle":"0","bdSize":"24"},"share":{}};with(document)0[(getElementsByTagName('head')[0]||body).appendChild(createElement('script')).src='http://bdimg.share.baidu.com/static/api/js/share.js?v=89860593.js?cdnversion='+~(-new Date()/36e5)];
您对本文章有什么意见或着疑问吗?请到 论坛讨论您的关注和建议是我们前行的参考和动力??
上一篇: boost::string 例题1
下一篇: C/C++基础笔试题1.0(字节对齐)
相关文章
<script type="text/java script">BAIDU_CLB_fillSlot("182716");
<script type="text/java script">BAIDU_CLB_fillSlot("517916");
图文推荐
<script> (function(){ var appid = 'cyrBEfE7C', conf = 'prod_830794cf494da8b808afb2994cfe0fee'; var doc = document, s = doc.createElement('script'), h = doc.getElementsByTagName('head')[0] || doc.head || doc.documentElement; s.type = 'text/java script'; s.charset = 'utf-8'; s.src = 'http://assets.changyan.sohu.com/upload/changyan.js?conf='+ conf +'&appid=' + appid; h.insertBefore(s,h.firstChild); window.SCS_NO_IFRAME = true; })()
<script type="text/java script">BAIDU_CLB_fillSlot("771057");
】【打印繁体】【投稿】【收藏】 【推荐】【举报】【评论】 【关闭】 【返回顶部
分享到: 
上一篇HDU-4643-GSM(DFS) 下一篇POJ 3692:Kindergarten(最大团)

评论

帐  号: 密码: (新用户注册)
验 证 码:
表  情:
内  容: