플리나를 위하여

// C 코드
long long sum(int *a, int n)
{
    int i;
	long long ans = 0;
    for(i = 0; i < n; i++)
    {
        ans += a[i];
    }
	return ans;
}

// C++ 코드
#include <vector>
long long sum(std::vector<int> &a)
{
    long long ret = 0;
    for (int i = 0; i < a.size(); i++)
    {
        ret += a[i];
    }
	return ret;
}

# 파이썬 코드
def solve(a):
    ans = 0
    for i in a:
        ans += i
    return ans

// Java 코드
public class Test {
    long sum(int[] a) {
        long ans = 0;
        for(int i = 0; i < a.length; i++)
        {
            ans += a[i];
        }
        return ans;
    }
}

// Go 코드
package main

func sum(a []int) int {
	var r int
    for _, i := range a{
		r += i
	}
	return r
}

#include <iostream>
using namespace std;

void BAEKJOON_4344()
{
	int C;
	cin >> C;

	int student;
	short int score[1000];
	short int overCount;
	float averageScore;
	
	cout << fixed;
	cout.precision(3);
	for (int i = 0; i < C; i++)
	{
		cin >> student;
		overCount = 0;
		averageScore = 0.f;
		for (int j = 0; j < student; j++)
		{
			cin >> score[j];
			averageScore += score[j];
		}
		averageScore /= student;
		for (int j = 0; j < student; j++)
		{
			if (static_cast<float>(score[j]) > averageScore)
			{
				overCount++;
			}
		}

		cout << static_cast<double>(overCount) / student * 100 << "%" << endl;
	}

	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_8958()
{
	int T;
	cin >> T;

	char** quizResult = new char* [T];
	for (int i = 0; i < T; i++)
	{
		quizResult[i] = new char [80];
		cin >> quizResult[i];
	}
	
	for (int i = 0; i < T; i++)
	{
		int result = 0;
		int point = 0;
		for (int j = 0; quizResult[i][j] != '\0'; j++)
		{
			if (quizResult[i][j] == 'O')
			{
				point++;
				result += point;
			}
			else
			{
				point = 0;
			}
		}
		cout << result << endl;
	}

	for (int i = 0; i < T; i++)
	{
		delete[] quizResult[i];
	}
	delete[] quizResult;

	return;
}

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