1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29

#include <iostream>		// 재귀를 이용
using namespace std;
int cnt[2] = { 0 };
int fibonacci(int n) {
	if (n == 0) {
		cnt[0]++;
		return 0;
	}
	else if (n == 1) {
		cnt[1]++;
		return 1;
	}
	else
		return fibonacci(n-1) + fibonacci(n-2);
}

int main(void) {
	int T,n;
	cin >> T;
	for (int i = 0; i < T; i++) {
		cin >> n;
		cnt[0] = 0;
		cnt[1] = 0;
		fibonacci(n);
		cout << cnt[0] << " " << cnt[1] << endl;
	}
	return 0;
}
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21

#include <iostream>			// 포문 이용
using namespace std;

int main(void) {
	int T, n;
	int a[41] = { 0 };
	int b[41] = { 0 };
	cin >> T;
	for (int i = 0; i < T; i++) {
		cin >> n;
		a[0] = 1;
		a[1] = 0;
		b[0] = 0;
		b[1] = 1;
		for (int t = 2; t <= n; t++) {
			a[t] = a[t - 1] + a[t - 2];
			b[t] = b[t - 1] + b[t - 2];
		}
		cout << a[n] << " " << b[n] << endl;
	}
}