1007母牛的故事

题目链接

Java版

import java.util.Scanner;
public class Main {
    static int[] f=new int[57];
    static int l=0;
    public static void main(String[] args) {
        f[1]=1;
        f[2]=2;
        f[3]=3;
        f[4]=4;
        f[5]=6;
        Scanner in =new Scanner(System.in);
    while(in.hasNext()){
        int N=in.nextInt();
         
        if(N<6)
             System.out.println(f[N]);
        else System.out.println(f(N));
    }
        in.close();}
    static int f(int n){
         
        if(l==0)
        {
         for(int i=6;i<57;i++)
            {
            f[i]=f[i-1]+f[i-3];l++;
             
            }}
        return f[n];
    }
 
}

C++版

#include<cstdio>
#include<algorithm>
#include<vector>
#include<cstring>
using namespace std;
const int maxn=60;
int arr[maxn];
int main(){
    int n;
    arr[1]=1;
    arr[2]=2;
    arr[3]=3;
    arr[4]=4;
    arr[5]=6;
    for(int i=6;i<=56;i++){
        arr[i]=arr[i-1]+arr[i-3];
    }
 
    while(scanf("%d",&n)!=EOF){
        printf("%d\n",arr[n]);
    }
    return 0;
}