public class solution{
public static void main(String[] args){
int month = 12;
System.out.println(recursion(month));
}
public static int recursion(int n){
int[][] m = new int[n][4];
if(n == 1){
m[0][2] = 1;
m[0][0] = 1;
m[0][3] = 1;
}
else{
m[0][2] = 1;
m[0][0] = 1;
m[0][3] = 1;
for(int i = 1; i<m.length; i++){
m[i][0] = i;
m[i][2] = m[i-1][2] + m[i-1][3];
m[i][3] = m[i][2];
m[i][1] = m[i][3] + m[i][2];
}
}
return m[n-1][1];
}
}
#include<stdio.h> #define N 12 void main() { int i; int f[N]={1,1}; printf("%d:%d\n",0,f[0]); printf("%d:%d\n",1,f[1]); for(i=2;i<N;i++) { f[i]=f[i-1]+f[i-2]; printf("%d:%d\n",i+1,f[i]); } }