플리나를 위하여

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

void BAEKJOON_11729()
{
	int N;
	cin >> N;
	string moveLog = "";
	cout << hanoiMove(N, '1', '2', '3', moveLog) << "\n";
	cout << moveLog;
	return;
}

int hanoiMove(int count, char from, char by, char to, string& moveLog)
{
	if (count == 1)
	{
		moveLog.push_back(from);
		moveLog.push_back(' ');
		moveLog.push_back(to);
		moveLog.push_back('\n');
		return 1;
	}
	int ret = 0;
	ret += hanoiMove(count - 1, from, to, by, moveLog);
	ret++;
	moveLog.push_back(from);
	moveLog.push_back(' ');
	moveLog.push_back(to);
	moveLog.push_back('\n');
	ret += hanoiMove(count - 1, by, from, to, moveLog);
	return ret;
}

#include <iostream>
using namespace std;

void BAEKJOON_2447()
{
	int size;
	cin >> size;
	// 배열 선언 및 초기화
	char** starArray = new char*[size];
	for(int i = 0; i < size; i++)
	{
		starArray[i] = new char[size + 2];
		for (int j = 0; j < size; j++)
		{
			starArray[i][j] = ' ';
		}
		starArray[i][size] = '\n';
		starArray[i][size + 1] = '\0';
	}
	// 재귀 함수 호출
	drawStar(starArray, 0, 0, size/3);
	// 결과 출력
	for(int i = 0; i < size; i++)
	{
		cout << starArray[i];
	}
	// 할당 해제
	for(int i = 0; i < size; i++)
	{
		delete[] starArray[i];
	}
	delete[] starArray;
	return;
}

void drawStar(char** starArray, int width, int height, int interval)
{
	// 그려야 하는 간격이 1이 아닌 경우 간격을 좁히면서 재귀함수 호출
	if (interval != 1)
	{
		for (int i = 0; i < 3; i++)
		{
			for (int j = 0; j < 3; j++)
			{
				if (i != 1 || j != 1)
				{
					drawStar(starArray, width + interval * i, height + interval * j, interval / 3);
				}
			}
		}
	}
	// 패턴 그리기
	for (int i = 0; i < 3; i++)
	{
		for (int j = 0; j < 3; j++)
		{
			if (i != 1 || j != 1)
			{
				starArray[width + i][height + j] = '*';
			}
		}
	}
}

#include <iostream>
using namespace std;

void BAEKJOON_10872()
{
	int N;
	cin >> N;
	int result = 1;
	for (int i = 2; i <= N; i++)
	{
		result *= i;
	}
	cout << result << endl;

	return;
}
// 재귀 함수로 구현 시
int factorial(int n)
{
    if(n == 0 || n == 1)
    {
        return 1;
    }
    return n * factorial(n - 1);
}

#include <iostream>
using namespace std;

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

	int count = 0;
	if (N < 100)
	{
		count = N;
	}
	else
	{
		count = 99;
		for (int i = 111; i <= N; i++)
		{
			if (i / 100 + i % 10 == i / 10 % 10 * 2 )
			{
				count++;
			}
		}
	}
	cout << count << endl;
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_4673()
{
	bool numArr[10036] = { false };

	for (int i = 1; i < 10000; i++)
	{
		int sum = i;
		int d = i;
		while (d != 0)
		{
			sum += d % 10;
			d /= 10;
		}
		numArr[sum] = true;

		if (!numArr[i])
		{
			cout << i << endl;
		}
	}
	return;
}

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