• <input id="auww4"></input>
  • <input id="auww4"><acronym id="auww4"></acronym></input>
  • <input id="auww4"><u id="auww4"></u></input>
    <object id="auww4"><acronym id="auww4"></acronym></object>
    <menu id="auww4"></menu><input id="auww4"><u id="auww4"></u></input>
    <input id="auww4"><u id="auww4"></u></input>
  • F.A.Q
    Hand In Hand
    Online Acmers
    Forum | Discuss
    Statistical Charts
    Problem Archive
    Realtime Judge Status
    Authors Ranklist
     
         C/C++/Java Exams     
    ACM Steps
    Go to Job
    Contest LiveCast
    ICPC@China
    Best Coder beta
    VIP | STD Contests
    Virtual Contests
        DIY | Web-DIY beta
    Recent Contests
    Author ID 
    Password 
     Register new ID

    Re:找到遞推的規律就簡單了

    Posted by cuicuicuicui at 2020-11-03 13:34:57 on Problem 2018
    (109)  


    #include<stdio.h>
    int laomu(int m)  //第m天的母牛數 
    {
    	if(m<=4)
    		return m;
    	else
    		return laomu(m-1)+laomu(m-3);
    }
    
    int main()
    {
    	int n;
    	while(~scanf("%d",&n))
    	{
    		if(n!=0)
    			printf("%d\n",laomu(n));
    	}
     }
    ----------------------------------------------------------------------------------

    Followed by:


    Post your reply here:

    Author ID
    Password
    Title
    Content  
     
    Hangzhou Dianzi University Online Judge 3.0
    Copyright © 2005-2021 HDU ACM Team. All Rights Reserved.
    Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
    Total 0.015600(s) query 5, Server time : 2021-01-20 22:26:29, Gzip enabled
    棋牌