﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>IT博客-木子</title><link>http://www.cnitblog.com/lifj1997/</link><description>小象</description><language>zh-cn</language><lastBuildDate>Mon, 04 May 2026 22:29:39 GMT</lastBuildDate><pubDate>Mon, 04 May 2026 22:29:39 GMT</pubDate><ttl>60</ttl><item><title>c++:母牛生小母牛问题</title><link>http://www.cnitblog.com/lifj1997/archive/2007/11/06/35931.html</link><dc:creator>lifengjie</dc:creator><author>lifengjie</author><pubDate>Tue, 06 Nov 2007 06:55:00 GMT</pubDate><guid>http://www.cnitblog.com/lifj1997/archive/2007/11/06/35931.html</guid><wfw:comment>http://www.cnitblog.com/lifj1997/comments/35931.html</wfw:comment><comments>http://www.cnitblog.com/lifj1997/archive/2007/11/06/35931.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cnitblog.com/lifj1997/comments/commentRss/35931.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/lifj1997/services/trackbacks/35931.html</trackback:ping><description><![CDATA[问题描述:<br>设有一头小母牛，从出生第四年起每年生一头小母牛，<br>按此规律，第N年时有几头母牛？<br><br>#include&nbsp;&lt;iostream&gt;<br>using&nbsp;namespace&nbsp;std;<br>int&nbsp;cows(int&nbsp;n)//求母牛的递归函数<br>{<br>&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;count;<br>&nbsp;&nbsp;&nbsp;&nbsp;if&nbsp;(n==5)count=3;<br>&nbsp;&nbsp;&nbsp;&nbsp;else&nbsp;count=cows(n-1)+n-5;&nbsp;//此处用递归法<br>&nbsp;&nbsp;&nbsp;&nbsp;return&nbsp;count;<br>}<br>void&nbsp;main()<br>{<br>&nbsp;&nbsp;&nbsp;&nbsp;cout&lt;&lt;"请输入年份数:&nbsp;";<br>&nbsp;&nbsp;&nbsp;&nbsp;int&nbsp;m;<br>&nbsp;&nbsp;&nbsp;&nbsp;cin&gt;&gt;m;<br>&nbsp;&nbsp;&nbsp;&nbsp;cout&lt;&lt;"第"&lt;&lt;m&lt;&lt;"年时共有"&lt;&lt;cows(m)&lt;&lt;"头母牛！"&lt;&lt;endl;<br>&nbsp;&nbsp;&nbsp;&nbsp;getchar();<br>}
<img src ="http://www.cnitblog.com/lifj1997/aggbug/35931.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/lifj1997/" target="_blank">lifengjie</a> 2007-11-06 14:55 <a href="http://www.cnitblog.com/lifj1997/archive/2007/11/06/35931.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>算法实现题1-1 统计数字问题</title><link>http://www.cnitblog.com/lifj1997/archive/2007/11/06/35930.html</link><dc:creator>lifengjie</dc:creator><author>lifengjie</author><pubDate>Tue, 06 Nov 2007 06:52:00 GMT</pubDate><guid>http://www.cnitblog.com/lifj1997/archive/2007/11/06/35930.html</guid><wfw:comment>http://www.cnitblog.com/lifj1997/comments/35930.html</wfw:comment><comments>http://www.cnitblog.com/lifj1997/archive/2007/11/06/35930.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.cnitblog.com/lifj1997/comments/commentRss/35930.html</wfw:commentRss><trackback:ping>http://www.cnitblog.com/lifj1997/services/trackbacks/35930.html</trackback:ping><description><![CDATA[算法实现题1-1&nbsp;统计数字问题<br><br>问题描述：<br>一本书的页码从自然数1&nbsp;开始顺序编码直到自然数n。书的页码按照通常的习惯编排，<br>每个页码都不含多余的前导数字0。例如，第6&nbsp;页用数字6&nbsp;表示，而不是06&nbsp;或006&nbsp;等。数<br>字计数问题要求对给定书的总页码n，计算出书的全部页码中分别用到多少次数字0，1，<br>2，&#8230;，9。<br><br>编程任务：<br><br>给定表示书的总页码的10&nbsp;进制整数n&nbsp;(1&#8804;n&#8804;109)&nbsp;。编程计算书的全部页码中分别用<br>到多少次数字0，1，2，&#8230;，9。<br>没啥技巧，瞎编，欢迎指导！<br>#include&lt;iostream&gt;<br>using namespace std;<br>void pagecount(int);<br>void main()<br>{<br>&nbsp;int n;<br>&nbsp;cout&lt;&lt;"请输入书的总页数：";<br>&nbsp;cin&gt;&gt;n;<br>&nbsp;pagecount(n);<br>&nbsp;getchar();<br>}<br>void pagecount(int n)<br>{<br>&nbsp;int i,j,length,A,B,C,D,E,F,G,H,L,K,WEI[10],m;<br>&nbsp;A=B=C=D=E=F=G=H=L=K=0;<br>&nbsp;for (i=1;i&lt;=n;i++)<br>&nbsp;{<br>&nbsp;&nbsp; if (i&lt;10)<br>&nbsp;&nbsp;&nbsp; switch(i)<br>&nbsp;&nbsp;{case 1:A++;break;<br>&nbsp;&nbsp;case 2:B++;break;<br>&nbsp;&nbsp;case 3:C++;break;<br>&nbsp;&nbsp;case 4:D++;break;<br>&nbsp;&nbsp;case 5:E++;break;<br>&nbsp;&nbsp;case 6:F++;break;<br>&nbsp;&nbsp;case 7:G++;break;<br>&nbsp;&nbsp;case 8:H++;break;<br>&nbsp;&nbsp;case 9:L++;break;<br>&nbsp;&nbsp;default:break;<br>&nbsp;&nbsp;}<br>&nbsp; else<br>&nbsp; {<br>&nbsp;&nbsp; m=i;<br>&nbsp;&nbsp; length=0;<br>&nbsp;&nbsp; while(m&gt;0)<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; WEI[length++]=m%10;<br>&nbsp;&nbsp;&nbsp; m/=10;<br>&nbsp;&nbsp; }<br>&nbsp;&nbsp; for (j=0;j&lt;length;j++)<br>&nbsp;&nbsp; {<br>&nbsp;&nbsp;&nbsp; switch(WEI[j])<br>&nbsp;&nbsp;&nbsp; {case 0:K++;break;<br>&nbsp;&nbsp;&nbsp; case 1:A++;break;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; case 2:B++;break;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; case 3:C++;break;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; case 4:D++;break;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; case 5:E++;break;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; case 6:F++;break;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; case 7:G++;break;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; case 8:H++;break;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; case 9:L++;break;<br>&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp; default:break;<br>&nbsp;&nbsp;&nbsp; }<br>&nbsp;&nbsp; }<br>&nbsp; }<br>&nbsp;}<br>&nbsp;if (K&gt;0)cout&lt;&lt;"用到的0的次数为："&lt;&lt;K&lt;&lt;endl;<br>&nbsp;if (A&gt;0)cout&lt;&lt;"用到的1的次数为："&lt;&lt;A&lt;&lt;endl;<br>&nbsp;if (B&gt;0)cout&lt;&lt;"用到的2的次数为："&lt;&lt;B&lt;&lt;endl;<br>&nbsp;if (C&gt;0)cout&lt;&lt;"用到的3的次数为："&lt;&lt;C&lt;&lt;endl;<br>&nbsp;if (D&gt;0)cout&lt;&lt;"用到的4的次数为："&lt;&lt;D&lt;&lt;endl;<br>&nbsp;if (E&gt;0)cout&lt;&lt;"用到的5的次数为："&lt;&lt;E&lt;&lt;endl;<br>&nbsp;if (F&gt;0)cout&lt;&lt;"用到的6的次数为："&lt;&lt;F&lt;&lt;endl;<br>&nbsp;if (G&gt;0)cout&lt;&lt;"用到的7的次数为："&lt;&lt;G&lt;&lt;endl;<br>&nbsp;if (H&gt;0)cout&lt;&lt;"用到的8的次数为："&lt;&lt;H&lt;&lt;endl;<br>&nbsp;if (L&gt;0)cout&lt;&lt;"用到的9的次数为："&lt;&lt;L&lt;&lt;endl;<br>}<br>
<img src ="http://www.cnitblog.com/lifj1997/aggbug/35930.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cnitblog.com/lifj1997/" target="_blank">lifengjie</a> 2007-11-06 14:52 <a href="http://www.cnitblog.com/lifj1997/archive/2007/11/06/35930.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>