1
//
HLOJ 1041 Accepted 0 192 378 C++
2
3 // 简单递推
4
5 #include < iostream >
6 using namespace std ;
7
8 const int size = 100 ;
9
10 __int64 dp[size] ;
11
12 int inn ;
13
14 int main()
15 {
16 while ( cin >> inn )
17 {
18 for ( int i = 1 ; i <= inn; i ++ ) dp[i] = 0 ;
19
20 dp[ 1 ] = 1 ;
21 dp[ 2 ] = 2 ;
22 dp[ 3 ] = 4 ;
23
24 for ( int i = 4 ; i <= inn; i ++ )
25 {
26 dp[i] = dp[i - 1 ] + dp[i - 2 ] + dp[i - 3 ] ;
27 }
28
29 printf( " %I64d\n " , dp[inn] ) ;
30 }
31 return 0 ;
32 }
2
3 // 简单递推
4
5 #include < iostream >
6 using namespace std ;
7
8 const int size = 100 ;
9
10 __int64 dp[size] ;
11
12 int inn ;
13
14 int main()
15 {
16 while ( cin >> inn )
17 {
18 for ( int i = 1 ; i <= inn; i ++ ) dp[i] = 0 ;
19
20 dp[ 1 ] = 1 ;
21 dp[ 2 ] = 2 ;
22 dp[ 3 ] = 4 ;
23
24 for ( int i = 4 ; i <= inn; i ++ )
25 {
26 dp[i] = dp[i - 1 ] + dp[i - 2 ] + dp[i - 3 ] ;
27 }
28
29 printf( " %I64d\n " , dp[inn] ) ;
30 }
31 return 0 ;
32 }