锘??xml version="1.0" encoding="utf-8" standalone="yes"?>99久久精品毛片免费播放,亚洲欧美日韩久久精品第一区,精品久久久久久久无码http://www.shnenglu.com/hoolee/category/19729.htmlIf you believe, you can!zh-cnTue, 25 Sep 2012 04:22:16 GMTTue, 25 Sep 2012 04:22:16 GMT60hdu1036--Average is not Fast Enough!http://www.shnenglu.com/hoolee/archive/2012/09/17/191014.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Mon, 17 Sep 2012 12:08:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/09/17/191014.htmlhttp://www.shnenglu.com/hoolee/comments/191014.htmlhttp://www.shnenglu.com/hoolee/archive/2012/09/17/191014.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/191014.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/191014.html瀛楃涓插鐞嗐佸洓鑸嶄簲鍏ャ?nbsp; 闃呰鍏ㄦ枃

]]>
hdu4278--Faulty Odometerhttp://www.shnenglu.com/hoolee/archive/2012/09/10/190145.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Mon, 10 Sep 2012 12:26:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/09/10/190145.htmlhttp://www.shnenglu.com/hoolee/comments/190145.htmlhttp://www.shnenglu.com/hoolee/archive/2012/09/10/190145.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/190145.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/190145.htmlhttp://acm.hdu.edu.cn/showproblem.php?pid=4278
浠婂勾澶╂觸璧涘尯緗戦夌涓棰橈紝寮濮?min灝辨湁浜虹鎺夛紝鏈変漢璇翠互鍓嶅仛榪囧師棰樸?br />鍏繘鍒舵暟涓庡崄榪涘埗鏁扮殑杞崲錛岀殑紜尯姘寸殑銆?br />浠g爜濡備笅錛?



]]>
poj1503--澶ф暣鏁板姞娉?/title><link>http://www.shnenglu.com/hoolee/archive/2012/08/11/186882.html</link><dc:creator>灝忛紶鏍?/dc:creator><author>灝忛紶鏍?/author><pubDate>Sat, 11 Aug 2012 00:58:00 GMT</pubDate><guid>http://www.shnenglu.com/hoolee/archive/2012/08/11/186882.html</guid><wfw:comment>http://www.shnenglu.com/hoolee/comments/186882.html</wfw:comment><comments>http://www.shnenglu.com/hoolee/archive/2012/08/11/186882.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/hoolee/comments/commentRss/186882.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/hoolee/services/trackbacks/186882.html</trackback:ping><description><![CDATA[澶ф暟鐩稿姞銆傚瓧絎︿覆澶勭悊錛屾敞鎰忕粏鑺傦紝娉ㄦ剰鍒濆鍖栥?br />浠ヤ笅鏄湰棰樹唬鐮侊細<br /><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_085805" onclick="this.style.display='none'; Code_Closed_Text_085805.style.display='none'; Code_Open_Image_085805.style.display='inline'; Code_Open_Text_085805.style.display='inline';" src="http://www.shnenglu.com/images/OutliningIndicators/ContractedBlock.gif" align="top" height="16" width="11"><img id="Code_Open_Image_085805" style="display: none" onclick="this.style.display='none'; Code_Open_Text_085805.style.display='none'; Code_Closed_Image_085805.style.display='inline'; Code_Closed_Text_085805.style.display='inline';" src="http://www.shnenglu.com/images/OutliningIndicators/ExpandedBlockStart.gif" align="top" height="16" width="11"><span id="Code_Closed_Text_085805" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff"></span><span id="Code_Open_Text_085805" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #000000; ">#include</span><span style="color: #000000; "><</span><span style="color: #000000; ">stdio.h</span><span style="color: #000000; ">></span><span style="color: #000000; "><br />#include</span><span style="color: #000000; "><</span><span style="color: #000000; ">stdlib.h</span><span style="color: #000000; ">></span><span style="color: #000000; "><br />#include</span><span style="color: #000000; "><</span><span style="color: #0000FF; ">string</span><span style="color: #000000; ">.h</span><span style="color: #000000; ">></span><span style="color: #000000; "><br /></span><span style="color: #0000FF; ">#define</span><span style="color: #000000; "> LEN 200</span><span style="color: #000000; "><br /></span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> Max(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> a, </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> b)<br />{<br />    </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(a </span><span style="color: #000000; ">></span><span style="color: #000000; "> b)<br />        </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> a;<br />    </span><span style="color: #0000FF; ">return</span><span style="color: #000000; "> b;<br />}<br /></span><span style="color: #0000FF; ">void</span><span style="color: #000000; "> Add(</span><span style="color: #0000FF; ">char</span><span style="color: #000000; "> </span><span style="color: #000000; ">*</span><span style="color: #000000; ">num1, </span><span style="color: #0000FF; ">char</span><span style="color: #000000; "> </span><span style="color: #000000; ">*</span><span style="color: #000000; ">num2)<br />{<br />    <br />    </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> len1, len2;<br />    </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> i, j;<br />    i </span><span style="color: #000000; ">=</span><span style="color: #000000; "> LEN </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />    </span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">(num1[</span><span style="color: #000000; ">--</span><span style="color: #000000; ">i] </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; "> </span><span style="color: #000000; ">&&</span><span style="color: #000000; "> i </span><span style="color: #000000; ">></span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">);<br />    len1 </span><span style="color: #000000; ">=</span><span style="color: #000000; "> i;<br />    len2 </span><span style="color: #000000; ">=</span><span style="color: #000000; "> strlen(num2);<br />    </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> lenm </span><span style="color: #000000; ">=</span><span style="color: #000000; "> Max(len1, len2);<br />    </span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(i </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">; i </span><span style="color: #000000; "><</span><span style="color: #000000; "> len2; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br />        num2[i] </span><span style="color: #000000; ">-=</span><span style="color: #000000; "> </span><span style="color: #000000; ">'</span><span style="color: #000000; ">0</span><span style="color: #000000; ">'</span><span style="color: #000000; ">;<br />    </span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(i </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">; i </span><span style="color: #000000; "><</span><span style="color: #000000; "> len2 </span><span style="color: #000000; ">/</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; ">; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)</span><span style="color: #008000; ">//</span><span style="color: #008000; ">reverse num2</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">    {<br />        </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> c </span><span style="color: #000000; ">=</span><span style="color: #000000; "> num2[i];<br />        num2[i] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> num2[len2 </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; "> </span><span style="color: #000000; ">-</span><span style="color: #000000; "> i];<br />        num2[len2 </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; "> </span><span style="color: #000000; ">-</span><span style="color: #000000; "> i] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> c;<br />    }<br />    </span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(i </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">; i </span><span style="color: #000000; "><</span><span style="color: #000000; "> lenm </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; ">; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)</span><span style="color: #008000; ">//</span><span style="color: #008000; ">add num1 && num2</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">        num1[i] </span><span style="color: #000000; ">+=</span><span style="color: #000000; "> num2[i];<br />    </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> t </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />    </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> t2;<br />    </span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(i </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">; i </span><span style="color: #000000; "><</span><span style="color: #000000; "> lenm </span><span style="color: #000000; ">+</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; ">; i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)</span><span style="color: #008000; ">//</span><span style="color: #008000; ">carry bit</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">    {<br />        t2 </span><span style="color: #000000; ">=</span><span style="color: #000000; "> num1[i] </span><span style="color: #000000; ">+</span><span style="color: #000000; "> t;<br />        num1[i] </span><span style="color: #000000; ">=</span><span style="color: #000000; "> t2 </span><span style="color: #000000; ">%</span><span style="color: #000000; "> </span><span style="color: #000000; ">10</span><span style="color: #000000; ">;<br />        t </span><span style="color: #000000; ">=</span><span style="color: #000000; "> t2 </span><span style="color: #000000; ">/</span><span style="color: #000000; "> </span><span style="color: #000000; ">10</span><span style="color: #000000; ">;<br />    }<br />}<br /></span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> main()<br />{<br />    </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> i, j;<br />    </span><span style="color: #0000FF; ">char</span><span style="color: #000000; "> num1[LEN];<br />    </span><span style="color: #0000FF; ">char</span><span style="color: #000000; "> num2[LEN]; <br />    memset(num1, </span><span style="color: #000000; ">0</span><span style="color: #000000; ">, </span><span style="color: #0000FF; ">sizeof</span><span style="color: #000000; ">(num1));<br />    memset(num2, </span><span style="color: #000000; ">0</span><span style="color: #000000; ">, </span><span style="color: #0000FF; ">sizeof</span><span style="color: #000000; ">(num2));<br />    gets(num2);<br />    </span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">(strcmp(num2, </span><span style="color: #000000; ">"</span><span style="color: #000000; ">0</span><span style="color: #000000; ">"</span><span style="color: #000000; ">) </span><span style="color: #000000; ">!=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />    {<br />        Add(num1, num2);<br />        memset(num2, </span><span style="color: #000000; ">0</span><span style="color: #000000; ">, </span><span style="color: #0000FF; ">sizeof</span><span style="color: #000000; ">(num2));<br />        gets(num2);<br />    }<br />    i </span><span style="color: #000000; ">=</span><span style="color: #000000; "> LEN </span><span style="color: #000000; ">-</span><span style="color: #000000; "> </span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br />    </span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">(num1[</span><span style="color: #000000; ">--</span><span style="color: #000000; ">i] </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; "> </span><span style="color: #000000; ">&&</span><span style="color: #000000; "> i </span><span style="color: #000000; ">></span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">);<br />    </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(i </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />        printf(</span><span style="color: #000000; ">"</span><span style="color: #000000; ">0\n</span><span style="color: #000000; ">"</span><span style="color: #000000; ">);<br />    </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />    {<br />        </span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(; i </span><span style="color: #000000; ">>=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">; i</span><span style="color: #000000; ">--</span><span style="color: #000000; ">)<br />            printf(</span><span style="color: #000000; ">"</span><span style="color: #000000; ">%d</span><span style="color: #000000; ">"</span><span style="color: #000000; ">, num1[i]);<br />        putchar(</span><span style="color: #000000; ">10</span><span style="color: #000000; ">);<br />    }<br />    </span><span style="color: #008000; ">//</span><span style="color: #008000; ">system("pause");</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">}<br /></span></span></div><img src ="http://www.shnenglu.com/hoolee/aggbug/186882.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/hoolee/" target="_blank">灝忛紶鏍?/a> 2012-08-11 08:58 <a href="http://www.shnenglu.com/hoolee/archive/2012/08/11/186882.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>poj1334--榪涘埗杞崲http://www.shnenglu.com/hoolee/archive/2012/08/10/186836.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Fri, 10 Aug 2012 08:58:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/08/10/186836.htmlhttp://www.shnenglu.com/hoolee/comments/186836.htmlhttp://www.shnenglu.com/hoolee/archive/2012/08/10/186836.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/186836.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/186836.html榪涘埗杞崲錛岄鐩姹傚疄鐜?-16涔嬮棿浠繪剰榪涘埗鐨勭浉浜掕漿鎹紝瓚呰繃10鐨勬暟瀛楃敤A銆丅銆丆絳夎〃紺猴紝緇撴灉涓嶈兘瓚呰繃7浣嶏紝鍚﹀垯杈撳嚭ERROR銆傛濊礬鏄厛灝嗗師鏁板瓧杞崲涓哄崄榪涘埗錛岀劧鍚庡啀杞崲涓虹洰鏍囪繘鍒躲傚瓧絎︿覆澶勭悊闂錛屾敞鎰忕粏鑺傘?br />琛ㄦ壃涓涓嬬錛屽張璁╂垜瀛﹀埌浜嗕笉灝戜笢瑗褲?br />浠g爜濡備笅錛?/div>


]]>
zoj1365--瀛楃涓插鐞?/title><link>http://www.shnenglu.com/hoolee/archive/2012/08/09/186726.html</link><dc:creator>灝忛紶鏍?/dc:creator><author>灝忛紶鏍?/author><pubDate>Thu, 09 Aug 2012 03:17:00 GMT</pubDate><guid>http://www.shnenglu.com/hoolee/archive/2012/08/09/186726.html</guid><wfw:comment>http://www.shnenglu.com/hoolee/comments/186726.html</wfw:comment><comments>http://www.shnenglu.com/hoolee/archive/2012/08/09/186726.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.shnenglu.com/hoolee/comments/commentRss/186726.html</wfw:commentRss><trackback:ping>http://www.shnenglu.com/hoolee/services/trackbacks/186726.html</trackback:ping><description><![CDATA[<div>铏界劧鏄竴閬撳緢姘村緢姘寸殑棰橈紝浣嗘槸鎴戞劅瑙夊緢鏈夊繀瑕佸啓鐐逛笢瑗褲?br />榪欐槸鍚屽璁╂垜甯ス璋冪殑棰橈紝澶у嚒浜轟滑閮戒笉鐖辯湅鍒漢浠g爜錛屾垜涔熸槸錛屼互鍓嶅緢灝戠湅鍒漢浠g爜錛屼笉鍚岀殑椋庢牸錛屼笉鍚岀殑鎯蟲硶錛岀湅璧鋒潵寰堣浜虹籂緇擄紝涓嶈繃榪欐褰誨簳璁╂垜杞彉浜嗘濇兂銆?br />榪欓亾棰樻病浠涔堝煎緱澶氳鐨勶紝灝辨槸鑰冨療瀵硅緭鍏ュ瓧絎︿覆鐨勫鐞嗐傚悓瀛﹁櫧鐒舵湁寰堝緇嗚妭娌℃湁娉ㄦ剰鍒幫紝浣嗘槸<strong>濂圭殑瑙i鎬濊礬鍗磋鎴戠殑鎬濊礬鐒曠劧涓鏂幫紝澶ф湁閱嶉啇鐏岄《涔嬫劅</strong>銆傜嫭瀛﹁屾棤鍙嬶紝瀛ら檵瀵¢椈錛岃鐨勪笉灝辨槸瀵′漢鍚椼?br />浠ヤ笅鏄湰棰樹唬鐮侊細</div><br /><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_111503" onclick="this.style.display='none'; Code_Closed_Text_111503.style.display='none'; Code_Open_Image_111503.style.display='inline'; Code_Open_Text_111503.style.display='inline';" src="http://www.shnenglu.com/images/OutliningIndicators/ContractedBlock.gif" align="top" height="16" width="11"><img id="Code_Open_Image_111503" style="display: none" onclick="this.style.display='none'; Code_Open_Text_111503.style.display='none'; Code_Closed_Image_111503.style.display='inline'; Code_Closed_Text_111503.style.display='inline';" src="http://www.shnenglu.com/images/OutliningIndicators/ExpandedBlockStart.gif" align="top" height="16" width="11"><span id="Code_Closed_Text_111503" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff"></span><span id="Code_Open_Text_111503" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #000000; ">#include</span><span style="color: #000000; "><</span><span style="color: #000000; ">stdio.h</span><span style="color: #000000; ">></span><span style="color: #000000; "><br />#include</span><span style="color: #000000; "><</span><span style="color: #000000; ">stdlib.h</span><span style="color: #000000; ">></span><span style="color: #000000; "><br />#include</span><span style="color: #000000; "><</span><span style="color: #0000FF; ">string</span><span style="color: #000000; ">.h</span><span style="color: #000000; ">></span><span style="color: #000000; "><br /></span><span style="color: #0000FF; ">#define</span><span style="color: #000000; "> LEN 200</span><span style="color: #000000; "><br /></span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> main()<br />{<br />    </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> i, j;<br />    </span><span style="color: #0000FF; ">char</span><span style="color: #000000; "> s0[LEN];<br />    </span><span style="color: #0000FF; ">char</span><span style="color: #000000; "> s1[LEN], s2[LEN];<br />    </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> cost;<br />    </span><span style="color: #0000FF; ">int</span><span style="color: #000000; "> earn </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />    </span><span style="color: #0000FF; ">char</span><span style="color: #000000; "> c0,c1;<br />    </span><span style="color: #0000FF; ">while</span><span style="color: #000000; ">(</span><span style="color: #000000; ">1</span><span style="color: #000000; ">)<br />    {<br />        gets(s0);<br />        </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(strcmp(s0, </span><span style="color: #000000; ">"</span><span style="color: #000000; ">#</span><span style="color: #000000; ">"</span><span style="color: #000000; ">) </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />            </span><span style="color: #0000FF; ">break</span><span style="color: #000000; ">;<br />        </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(strcmp(s0,</span><span style="color: #000000; ">"</span><span style="color: #000000; ">0</span><span style="color: #000000; ">"</span><span style="color: #000000; ">) </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">)<br />        {<br />            printf(</span><span style="color: #000000; ">"</span><span style="color: #000000; ">%d\n</span><span style="color: #000000; ">"</span><span style="color: #000000; ">, earn);<br />            earn </span><span style="color: #000000; ">=</span><span style="color: #000000; "> </span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br />            </span><span style="color: #0000FF; ">continue</span><span style="color: #000000; ">;<br />        }<br />        sscanf(s0, </span><span style="color: #000000; ">"</span><span style="color: #000000; ">%s%s%d%c%c</span><span style="color: #000000; ">"</span><span style="color: #000000; ">, s1, s2, </span><span style="color: #000000; ">&</span><span style="color: #000000; ">cost, </span><span style="color: #000000; ">&</span><span style="color: #000000; ">c1, </span><span style="color: #000000; ">&</span><span style="color: #000000; ">c0);<br />        </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(c0 </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">'</span><span style="color: #000000; ">F</span><span style="color: #000000; ">'</span><span style="color: #000000; ">)<br />        {<br />            earn </span><span style="color: #000000; ">+=</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; "> </span><span style="color: #000000; ">*</span><span style="color: #000000; "> cost;<br />        }<br />        </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(c0 </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">'</span><span style="color: #000000; ">B</span><span style="color: #000000; ">'</span><span style="color: #000000; ">)<br />        {<br />            earn </span><span style="color: #000000; ">+=</span><span style="color: #000000; "> cost </span><span style="color: #000000; ">+</span><span style="color: #000000; "> cost </span><span style="color: #000000; ">/</span><span style="color: #000000; "> </span><span style="color: #000000; ">2</span><span style="color: #000000; ">;<br />        }<br />        </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "> </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(c0 </span><span style="color: #000000; ">==</span><span style="color: #000000; "> </span><span style="color: #000000; ">'</span><span style="color: #000000; ">Y</span><span style="color: #000000; ">'</span><span style="color: #000000; ">)<br />        {<br />            </span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(cost </span><span style="color: #000000; "><=</span><span style="color: #000000; "> </span><span style="color: #000000; ">500</span><span style="color: #000000; ">)<br />                earn </span><span style="color: #000000; ">+=</span><span style="color: #000000; "> </span><span style="color: #000000; ">500</span><span style="color: #000000; ">;<br />            </span><span style="color: #0000FF; ">else</span><span style="color: #000000; "><br />                earn </span><span style="color: #000000; ">+=</span><span style="color: #000000; "> cost;<br />        }<br />        </span><span style="color: #008000; ">//</span><span style="color: #008000; "><br />        </span><span style="color: #008000; ">//</span><span style="color: #008000; ">printf("s0 = %s\n", s0);<br />        </span><span style="color: #008000; ">//</span><span style="color: #008000; ">printf("s1 = %s s2 = %s cost = %d c = %c\n", s1, s2, cost, c0);<br />        </span><span style="color: #008000; ">//<br /></span><span style="color: #000000; ">    }<br />    </span><span style="color: #008000; ">//</span><span style="color: #008000; ">system("pause");</span><span style="color: #008000; "><br /></span><span style="color: #000000; ">}<br /></span></span></div><img src ="http://www.shnenglu.com/hoolee/aggbug/186726.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.shnenglu.com/hoolee/" target="_blank">灝忛紶鏍?/a> 2012-08-09 11:17 <a href="http://www.shnenglu.com/hoolee/archive/2012/08/09/186726.html#Feedback" target="_blank" style="text-decoration:none;">鍙戣〃璇勮</a></div>]]></description></item><item><title>zoj1201http://www.shnenglu.com/hoolee/archive/2012/08/02/186041.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Thu, 02 Aug 2012 08:19:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/08/02/186041.htmlhttp://www.shnenglu.com/hoolee/comments/186041.htmlhttp://www.shnenglu.com/hoolee/archive/2012/08/02/186041.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/186041.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/186041.html榪欎竴棰橀鐩湁浜涢暱錛屼笉榪囪繖涓嶅獎鍝嶅畠鏄竴閬撴按棰樸?br />棰樻剰鎻忚堪錛?br />棰樹腑鎻忚堪浜嗕袱縐嶆儏鍐碉紝褰撹緭鍏ユ暟鎹互'P'寮澶存椂錛岃〃紺鴻緭鍏ョ殑鏄?~N鐨勪竴涓帓鍒楋紝瑕佹眰杈撳嚭姣忎釜鏁板墠闈㈡瘮璇ユ暟澶х殑鏁板瓧鐨勪釜鏁幫紝杈撳嚭緇撴灉鏃墮『搴忎負鏁板瓧1鐨勫湪鍓嶏紝鏁板瓧N鐨勫湪鏈鍚庛傜浜岀鎯呭喌姝eソ鐩稿弽錛岀粰鍑烘瘡涓暟瀛楀墠闈㈡瘮璇ユ暟澶х殑鏁板瓧鐨勪釜鏁幫紝瑕佹眰杈撳嚭鍘熷簭鍒椼?br />絎竴縐嶆儏鍐靛ソ璇達紝涓昏鏄浜岀鎯呭喌銆?strong>鎯呭喌浜岀殑瑙f硶鏄寜浠庡悗寰鍓嶉『搴忕‘瀹氬師搴忓垪錛?/strong>鍗沖厛紜畾鏁板瓧N鐨勪綅緗紝鍐嶇‘瀹氭暟瀛桸-1鐨勪綅緗?#8230;…鐩村埌鎵鏈夋暟瀛椾綅緗‘瀹氥傛湡闂翠富瑕佹槸鍏冪礌鐨勬彃鍏ユ搷浣溿?/div>


]]>
zoj1151http://www.shnenglu.com/hoolee/archive/2012/07/31/185758.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Tue, 31 Jul 2012 08:58:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/07/31/185758.htmlhttp://www.shnenglu.com/hoolee/comments/185758.htmlhttp://www.shnenglu.com/hoolee/archive/2012/07/31/185758.html#Feedback1http://www.shnenglu.com/hoolee/comments/commentRss/185758.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/185758.html涓嬮潰榪欓亾棰樻槸緇忓吀鐨?#8220;鍥炴枃”棰橈紝瑕佹眰杈撳嚭姣忓彞璇濅腑姣忎釜鍗曡瘝鐨勫洖鏂囷紝浣嗘槸鍗曡瘝鍦ㄥ彞瀛愪腑鐨勪綅緗笉鍙樸?



]]>
zoj1115http://www.shnenglu.com/hoolee/archive/2012/07/31/185755.html灝忛紶鏍?/dc:creator>灝忛紶鏍?/author>Tue, 31 Jul 2012 08:15:00 GMThttp://www.shnenglu.com/hoolee/archive/2012/07/31/185755.htmlhttp://www.shnenglu.com/hoolee/comments/185755.htmlhttp://www.shnenglu.com/hoolee/archive/2012/07/31/185755.html#Feedback0http://www.shnenglu.com/hoolee/comments/commentRss/185755.htmlhttp://www.shnenglu.com/hoolee/services/trackbacks/185755.html褰誨簳鐨勬按棰橈紝鍥犱負娌℃湁璇存暟鎹噺錛屾垜鎶婃暟緇勫紑灝忎簡錛孲F浜嗗洓嬈★紝鏈鍚庢妸鏁板瓧涓查暱

搴﹀紑鍒?000鎵嶈繃錛岀湡鏄潙鐖瑰晩銆?/p>




]]>
久久久国产一区二区三区| 人妻无码久久精品| 97超级碰碰碰久久久久| 成人午夜精品久久久久久久小说| 99久久综合国产精品二区| 久久精品国产一区| 国产亚洲精品久久久久秋霞| 国产一级持黄大片99久久| 国产毛片久久久久久国产毛片| 亚洲欧美另类日本久久国产真实乱对白| 亚洲午夜无码久久久久| 97久久久久人妻精品专区| 久久久久国产视频电影| 亚洲中文字幕无码一久久区| 久久久国产精品网站| 免费精品99久久国产综合精品| 久久夜色精品国产www| 久久国产综合精品五月天| 日日躁夜夜躁狠狠久久AV| 日产精品久久久久久久| 久久久久久一区国产精品| 色偷偷偷久久伊人大杳蕉| 综合久久一区二区三区 | 精品国产青草久久久久福利| 久久久久亚洲AV无码麻豆| 国内精品九九久久久精品| 国产91色综合久久免费| 久久无码高潮喷水| 亚洲?V乱码久久精品蜜桃| 国产精品99久久不卡| 国产精品久久久久9999| 久久久久久久久无码精品亚洲日韩 | 精品999久久久久久中文字幕 | 久久国产亚洲精品麻豆| 亚洲AV无码成人网站久久精品大| 亚洲午夜久久久久妓女影院| 久久影院久久香蕉国产线看观看| 久久99精品久久久久久9蜜桃| 久久免费精品视频| 91久久九九无码成人网站| 久久婷婷五月综合97色直播|