플리나를 위하여

#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;
}

#include <iostream>
using namespace std;

// while (true)인 경우
void BAEKJOON_10952()
{
	int A;
	int B;
	while (true)
	{
		cin >> A >> B;
		if (A == 0 && B == 0)
		{
			break;
		}
		cout << A + B << endl;
	}
	return;
}

// while문 안에 cin과 반복조건 입력
void BAEKJOON_10952()
{
	int A;
	int B;
	while (cin >> A >> B && (A != 0 || B != 0))
	{
		cout << A + B << endl;
	}
	return;
}

// scanf - printf 코드
#include <cstdio>
 
void BAEKJOON_10871()
{
    int N;
    int X;
    scanf("%d %d", &N, &X);
 
    for (int i = 0; i < N; i++)
    {
        int input;
        scanf("%d", &input);
        if (input < X)
        {
            printf("%d ", input);
        }
    }
 
    return;
}
 
// cin - cout 코드
#include <iostream>
using namespace std;
 
void BAEKJOON_10871()
{
    int N;
    int X;
    cin >> N >> X;
 
    int * A = new int[N];
    for (int i = 0; i < N; i++)
    {
        cin >> A[i];
    }
    for (int i = 0; i < N; i++)
    {
        if (A[i] < X) {
            cout << A[i] << " ";
        }
    }
 
    delete[] A;
    return;
}

#include <iostream>
using namespace std;

void BAEKJOON_2439()
{
    int n;
 
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        for (int space = 1; space <= n - i; space++)
        {
            cout << " ";
        }
        for (int star = 1; star <= i; star++)
        {
            cout << "*";
        }
        cout << "\n";
    }
    return;
}

#include <iostream>
using namespace std;

void BAEKJOON_2438()
{
    int n;
 
    cin >> n;
    for (int i = 1; i <= n; i++)
    {
        for (int j = 1; j <= i; j++)
        {
            cout << "*";
        }
        cout << "\n";
    }
    return;
}

#include <iostream>
using namespace std;

void BAEKJOON_11022()
{
    int T;
    int A;
    int B;
 
    cin >> T;
    for (int i = 1; i <= T; i++)
    {
        cin >> A >> B;
        cout << "Case #" << i << ": " << A << " + " << B << " = " << A + B << "\n";
    }
 
    return;
}