Aizu Online Judge 0168 Kannondou

■0168 Kannondou

動的計画法．

dp[段数]=組み合わせ
dp[0]=1
dp[i]=dp[i-1]+dp[i-2]+dp[i-3]

import java.util.*;
import java.lang.*;
import java.math.*;
import java.io.*;

import static java.lang.Math.*;
import static java.util.Arrays.*;

public class Main{

 Scanner sc=new Scanner(System.in);

 int INF=1<<28;
 double EPS=1e-9;

 void run(){
  for(;;){
   int n=sc.nextInt();
   if(n==0){
    break;
   }
   int[] dp=new int[n+4];
   dp[0]=1;
   for(int i=0; i<=n; i++){
    dp[i+1]+=dp[i];
    dp[i+2]+=dp[i];
    dp[i+3]+=dp[i];
   }
   int ans=((dp[n]+9)/10+364)/365;
   println(ans+"");
  }
 }

 void debug(Object... os){
  System.err.println(Arrays.deepToString(os));
 }

 void print(String s){
  System.out.print(s);
 }

 void println(String s){
  System.out.println(s);
 }

 public static void main(String[] args){
  // System.setOut(new PrintStream(new BufferedOutputStream(System.out)));
  new Main().run();
 }
}