Quantcast
Channel: CSDN博客推荐文章
Viewing all articles
Browse latest Browse all 35570

2018

$
0
0
#include <stdio.h>
int main (void)
{
    int n,i,s,a,b,c,d,t;
    while(scanf("%d",&n)!=EOF)
    {
        if(!n)
            break;
        if(n>3)
        {
            a=1,b=2,c=3;
            for(i=0;i<n-3;i++)   //已经用a,b,c代替1,2,3天的头数了
            {
                s=a+c;
                a=b,b=c,c=s;
            }
        }
        else
            s=n;
        printf("%d\n",s);
    }
    return 0;
}
作者:hncu1206401liuhao 发表于2013-4-21 10:16:15 原文链接
阅读:60 评论:0 查看评论

Viewing all articles
Browse latest Browse all 35570

Trending Articles



<script src="https://jsc.adskeeper.com/r/s/rssing.com.1596347.js" async> </script>