플리나를 위하여

#include <iostream>
using namespace std;

void BAEKJOON_1003()
{
	int T;
	cin >> T;
	int fib[41] = { 0 };
	fib[0] = 0;
	fib[1] = 1;
	for (int i = 0; i < T; ++i)
	{
		int n;
		int callZero;
		int callOne;
		cin >> n;
		if (n == 0)
		{
			callZero = 1;
			callOne = 0;
		}
		else if (n == 1)
		{
			callZero = 0;
			callOne = 1;
		}
		else
		{
			for (int i = 2; i <= n; ++i)
			{
				if (fib[i] == 0)
				{
					fib[i] = fib[i - 1] + fib[i - 2];
				}
			}
			callZero = fib[n - 1];
			callOne = fib[n];
		}
		cout << callZero << " " << callOne << endl;
	}
	return;
}

#include <iostream>
using namespace std;
// 동적 계획법
void BAEKJOON_2748()
{
	uint64_t n;
	cin >> n;

	if (n == 1 || n == 2)
	{
		cout << 1 << endl;
	}
	else
	{
		uint64_t* fib = new uint64_t[n];
		fib[0] = 1;
		fib[1] = 1;
		for (int i = 2; i < n; i++)
		{
			fib[i] = fib[i - 1] + fib[i - 2];
		}
		cout << fib[n - 1] << endl;
		delete[] fib;
	}
	return;
}

#include <iostream>
using namespace std;
// 반복문 풀이
void BAEKJOON_2748()
{
	uint64_t n;
	cin >> n;

	uint64_t fib = 0;
	if (n == 1 || n == 2)
	{
		fib = 1;
	}
	else
	{
		uint64_t fib1 = 1;
		uint64_t fib2 = 1;
		fib;
		for (int i = 3; i <= n; i++)
		{
			fib = fib1 + fib2;
			fib1 = fib2;
			fib2 = fib;
		}
	}
	cout << fib << endl;
	return;
}

#include <iostream>
#include <string>
#include <vector>
using namespace std;
// vector를 이용한 방법
void BAEKJOON_10814()
{
	int N;
	cin >> N;
	vector<string> member[201];
	for (int i = 0; i < N; ++i)
	{
		int age;
		string name;
		cin >> age >> name;
		member[age].push_back(name);
	}
	for (int i = 0; i < 201; ++i)
	{
		for (auto it = member[i].begin(); it != member[i].end(); ++it)
		{
			cout << i << " " << *it << "\n";
		}
	}
	return;
}

#include <iostream>
#include <map>
#include <string>
using namespace std;
// multimap을 이용한 방법
void BAEKJOON_10814()
{
	int N;
	cin >> N;
	multimap<int, string> member;
	for (int i = 0; i < N; ++i)
	{
		int age;
		string name;
		cin >> age >> name;
		member.insert(pair<int, string>(age, name));
	}
	for (auto it = member.begin(); it != member.end(); ++it)
	{
		cout << it->first << " " << it->second << "\n";
	}
	return;
}

#include <iostream>
#include <iostream>
#include <string>
using namespace std;
// 비교함수를 만들어서 sort 하는 경우
bool cmp_1181(const string& left, const string& right)
{
	if (left.length() == right.length())
	{
		return left < right;
	}
	return left.length() < right.length();
}
void BAEKJOON_1181()
{
	int N;
	cin >> N;
	string* word = new string[N + 1];
	for (int i = 0; i < N; ++i)
	{
		cin >> word[i];
	}
	sort(word, word + N, cmp_1181);
	for (int i = 0; i < N; ++i)
	{
		if (word[i] == word[i + 1])
		{
			continue;
		}
		cout << word[i] << "\n";
	}
	delete[] word;
	return;
}

#include <algorithm>
#include <iostream>
#include <string>
#include <vector>
using namespace std;
// length별로 그룹을 나눈 후 sort 하는 경우
void BAEKJOON_1181()
{
	int N;
	cin >> N;
	string word;
	vector<string> wordList[51];
	for (int i = 0; i < N; ++i)
	{
		cin >> word;
		wordList[word.size()].push_back(word);
	}
	for (int i = 0; i < 51; ++i)
	{
		sort(wordList[i].begin(), wordList[i].begin() + wordList[i].size());
		for (auto it = wordList[i].begin(); it != wordList[i].end(); ++it)
		{
			if (it != wordList[i].begin())
			{
				if (*it == *(it - 1))
				{
					continue;
				}
			}
			cout << *it << "\n";
		}
	}
	return;
}

#include <iostream>
#include <algorithm>
using namespace std;

void BAEKJOON_11651()
{
	int N;
	cin >> N;

	pair<int, int>* point = new pair<int, int>[N];
	for (int i = 0; i < N; ++i)
	{
		cin >> point[i].second >> point[i].first;
	}
	sort(point, point + N);
	for (int i = 0; i < N; ++i)
	{
		cout << point[i].second << " " << point[i].first << "\n";
	}
	delete[] point;
	return;
}

#include <iostream>
#include <algorithm>
using namespace std;

void BAEKJOON_11650()
{
	int N;
	cin >> N;

	pair<int, int>* point = new pair<int, int>[N];
	for (int i = 0; i < N; ++i)
	{
		cin >> point[i].first >> point[i].second;
	}
	sort(point, point + N);
	for (int i = 0; i < N; ++i)
	{
		cout << point[i].first << " " << point[i].second << "\n";
	}
	delete[] point;
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_1427()
{
	int N;
	cin >> N;
	char index[10] = { 0 };
	while (N > 0)
	{
		index[N % 10]++;
		N /= 10;
	}
	for (int i = 9; i >= 0; --i)
	{
		for (int j = 0; j < index[i]; ++j)
		{
			cout << i;
		}
	}
	cout << endl;
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_2108()
{
	int N;
	cin >> N;
	int32_t index[8001] = { 0 };
	int32_t sum = 0;
	int16_t min = 4000;
	int16_t max = -4000;
	for (int i = 0; i < N; ++i)
	{
		int16_t input;
		cin >> input;
		if (min > input)
		{
			min = input;
		}
		if (max < input)
		{
			max = input;
		}
		sum += input;
		index[input + 4000]++;
	}
	// 산술평균
	double average = (double)sum / N;
	average = average > 0 ? average + 0.5 : average - 0.5;
	cout << static_cast<int32_t>(average * 10) / 10 << endl;
	// 중앙값
	int32_t middle = N / 2;
	for (int i = 0; i < 8001; i++)
	{
		middle -= index[i];
		if (middle < 0)
		{
			middle = i - 4000;
			break;
		}
	}
	cout << middle << endl;
	// 최빈값
	int16_t mode;
	int32_t count = 0;
	bool overlap = false;
	for (int i = 0; i < 8001; ++i)
	{
		if (count < index[i])
		{
			count = index[i];
			mode = i - 4000;
			overlap = false;
		}
		else if (count == index[i] && !overlap)
		{
			mode = i - 4000;
			overlap = true;
		}
	}
	cout << mode << endl;
	// 범위
	cout << max - min << endl;
	return;
}