﻿<?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>C++博客-Cold Code-最新评论</title><link>http://www.cppblog.com/bigeast/CommentsRSS.aspx</link><description /><language>zh-cn</language><pubDate>Mon, 06 Dec 2010 10:21:39 GMT</pubDate><lastBuildDate>Mon, 06 Dec 2010 10:21:39 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: hdoj_1005_Number Sequence</title><link>http://www.cppblog.com/bigeast/archive/2010/11/18/134004.html#134005</link><dc:creator>威士忌</dc:creator><author>威士忌</author><pubDate>Thu, 18 Nov 2010 09:14:00 GMT</pubDate><guid>http://www.cppblog.com/bigeast/archive/2010/11/18/134004.html#134005</guid><description><![CDATA[int main()<br>{<br>    int A,B,n,i,j,num,m;<br>    int a[1000];<br>    while(scanf(&quot;%d %d %d&quot;,&amp;A,&amp;B,&amp;n)!=EOF)<br>    {<br>        if(A==0 &amp;&amp; B==0 &amp;&amp; n==0)<br>            break;<br>        a[1]=1;a[2]=1;<br>        for(i=3;i&lt;50;i++)<br>            a[i]=( A * a[i - 1] + B * a[i - 2]) % 7;<br>        m=1;<br>        for(j=3;j&lt;50;j++)<br>            if(a[j]==1 &amp;&amp; a[j-1]==1)<br>                break;<br>        j-=2;<br>        num=n%j;<br>        if(num==0)<br>            printf(&quot;%d\n&quot;,a[j]);<br>        else<br>            printf(&quot;%d\n&quot;,a[num]);<br>    }<br>    return 0;<br>}<img src ="http://www.cppblog.com/bigeast/aggbug/134005.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/bigeast/" target="_blank">威士忌</a> 2010-11-18 17:14 <a href="http://www.cppblog.com/bigeast/archive/2010/11/18/134004.html#134005#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>