플리나를 위하여

#include <iostream>
using namespace std;

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

	int input;
	int best = 0;
	float average = 0;
	for (int i = 0; i < N; i++)
	{
		cin >> input;
		best = input > best ? input : best;
		average += input / static_cast<float>(N);
	}
	average = average / best * 100;

	cout << average << endl;

	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_3052()
{
	bool index[42] = { false };
	int input;
	int count = 0;

	for (int i = 0; i < 10; i++)
	{
		cin >> input;
		if (index[input % 42] == false)
		{
			index[input % 42] = true;
			count++;
		}
	}

	cout << count << endl;

	return;
}

#include <iostream>
using namespace std;

void BARKJOON_2577()
{
	char index[10] = { 0 };
	int result = 1;
	for (int i = 0; i < 3; i++)
	{
		int input;
		cin >> input;
		result *= input;
	}

	while (result > 0)
	{
		index[result % 10]++;
		result /= 10;
	}

	for (int i = 0; i <= 9; i++)
	{
		cout << (int)index[i] << endl;
	}

	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_2920()
{
	char numbers[8];
	for (int i = 0; i < 8; i++)
	{
		cin >> numbers[i];
	}

	int result;
	result = numbers[1] - numbers[0];
	for (int i = 1; i < 7; i++)
	{
		if (numbers[i + 1] - numbers[i] != result)
		{
			result = 0;
			break;
		}
	}

	if (result == 1)
	{
		cout << "ascending" << endl;
	}
	else if (result == -1)
	{
		cout << "descending" << endl;
	}
	else
	{
		cout << "mixed" << endl;
	}

	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_2562()
{
	int inputNumber;
	int max = 0;
	int maxPos = 0;

	for (int i = 0; i < 9; i++)
	{
		cin >> inputNumber;
		if (max < inputNumber)
		{
			max = inputNumber;
			maxPos = i + 1;
		}
	}
	cout << max << endl;
	cout << maxPos << endl;

	return;
}

#include <iostream>
using namespace std;

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

    int max = -1000001;
    int min = 1000001;
    for(int i = 0; i < N; i++)
    {
		int temp;
        cin >> temp;
        if(temp > max)
        {
            max = temp;
        }
        if(temp < min)
        {
            min = temp;
        }
    }
    cout << min << " " << max << "\n";
    return;
}

#include <iostream>
using namespace std;

void BAEKJOON_1110()
{
	int N;
	cin >> N;
	
	int currentNumber = N;
	int cycleLength = 0;
	while (true)
	{
		cycleLength++;
		int leftNumber = currentNumber % 10;
		int rightNumber = (currentNumber / 10 + currentNumber % 10) % 10;
		currentNumber = leftNumber * 10 + rightNumber;
		if (currentNumber == N)
		{
			break;
		}
	}
	cout << cycleLength << endl;

	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_10951()
{
	int A;
	int B;
	while (cin >> A >> B)
	{
		cout << A + B << endl;
	}
	return;
}