1
//
1218 Accepted 31 136 572 C++
2
3 // 简单递推
4
5 #include < iostream >
6 #include < string >
7 #include < algorithm >
8 using namespace std ;
9
10 const int size = 2000 ;
11
12 int tnum ;
13 int inn ;
14
15 struct NODE
16 {
17 int a ;
18 int b ;
19 };
20 struct NODE data[ 100 ] ;
21
22 int main()
23 {
24 while ( cin >> tnum )
25 {
26 while ( tnum -- )
27 {
28 scanf( " %d " , & inn ) ;
29 memset( data, 0 , sizeof (data) ) ;
30
31 data[ 0 ].a = data[ 0 ].b = 1 ;
32
33 for ( int i = 1 ; i <= inn; i ++ )
34 {
35 data[i].a = data[i - 1 ].b ;
36 data[i].b = data[i - 1 ].a + data[i - 1 ].b ;
37 }
38
39 printf( " %d %d\n " , data[inn].a, data[inn].b ) ;
40 }
41 }
42
43 return 0 ;
44 }
2
3 // 简单递推
4
5 #include < iostream >
6 #include < string >
7 #include < algorithm >
8 using namespace std ;
9
10 const int size = 2000 ;
11
12 int tnum ;
13 int inn ;
14
15 struct NODE
16 {
17 int a ;
18 int b ;
19 };
20 struct NODE data[ 100 ] ;
21
22 int main()
23 {
24 while ( cin >> tnum )
25 {
26 while ( tnum -- )
27 {
28 scanf( " %d " , & inn ) ;
29 memset( data, 0 , sizeof (data) ) ;
30
31 data[ 0 ].a = data[ 0 ].b = 1 ;
32
33 for ( int i = 1 ; i <= inn; i ++ )
34 {
35 data[i].a = data[i - 1 ].b ;
36 data[i].b = data[i - 1 ].a + data[i - 1 ].b ;
37 }
38
39 printf( " %d %d\n " , data[inn].a, data[inn].b ) ;
40 }
41 }
42
43 return 0 ;
44 }