플리나를 위하여

#include <iostream>
using namespace std;

void BAEKJOON_2869()
{
	int A;
	int B;
	int V;
	cin >> A >> B >> V;

	int movePerDay = A - B;
	V -= A;
	int totalDays;
	totalDays = V % movePerDay == 0 ? V / movePerDay + 1 : V / movePerDay + 2;
	cout << totalDays << endl;
	return;
}

#include <iostream>
using namespace std;

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

	for (int i = 0; i < T; i++)
	{
		int x;
		int y;
		cin >> x >> y;	
		y -= x;

		int moveLength = 0;
		int moveCount = 0;
		while(y > 0)
		{
			moveLength++;
			y -= moveLength * 2;
			moveCount += 2;
		}
		if (y + moveLength <= 0)
		{
			moveCount--;
		}
		cout << moveCount << endl;
	}
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_1193()
{
	int X;
	cin >> X;
	int n = 1;
	for (int i = 1; X > i; i++)
	{
		X -= i;
		n++;
	}

	int denominator;
	int numerator;
	if (n % 2)
	{
		denominator = X;
		numerator = n - X + 1;
	}
	else
	{
		denominator = n - X + 1;
		numerator = X;
	}

	cout << numerator << "/" << denominator << endl;
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_2292()
{
	int N;
	cin >> N;
	N--;
	int count = 1;
	for (int i = 1; N > 0 ; i++)
	{
		count++;
		N -= 6 * i;
	}
	cout << count << endl;
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_2839()
{
	int N;
	cin >> N;
	int result = -1;

	for (int i = N / 5; i >= 0; i--)
	{
		int current = N - i * 5;
		if (current % 3 == 0)
		{
			result = i + current / 3;
			break;
		}
	}
	cout << result << endl;
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_1712()
{
	int A;
	int B;
	int C;
	cin >> A >> B >> C;

	int result;
	if (C - B > 0)
	{
		result = A / (C - B) + 1;
	}
	else
	{
		result = -1;
	}
	cout << result << endl;
	return;
}

#include <iostream>
using namespace std;
// 인덱스에 상태를 기입하여 체크하는 방식
void BAEKJOON_1316()
{
	int N;
	cin >> N;

	int result = 0;
	bool index[26];
	char input[101];
	for (int i = 0; i < N; i++)
	{
		cin >> input;
		result++;
		for (int j = 0; j < 26; j++)
		{
			index[j] = false;
		}
		for(int j = 0; input[j] != '\0'; j++)
		{
			if (!index[input[j] - 'a'])
			{
				index[input[j] - 'a'] = true;
				while (input[j + 1] == input[j])
				{
					j++;
				}
			}
			else
			{
				result--;
				break;
			}
		}
	}
	cout << result << endl;
	return;
}

// string에 문자를 넣고 체크하는 방식
void BAEKJOON_1316()
{
	int N;
	cin >> N;

	int result = 0;
	string index;
	string input;
	for (int i = 0; i < N; i++)
	{
		index = "";
		cin >> input;
		result++;
		for (int j = 0; j < input.size(); j++)
		{
			if (index.find(input[j]) == string::npos)
			{
				index.push_back(input[j]);
				while (input[j] == input[j + 1])
				{
					j++;
				}
			}
			else
			{
				result--;
				break;
			}
		}
	}
	cout << result << endl;
	return;
}

#include <iostream>
using namespace std;

void BAEKJOON_2941()
{
	int charCount = 0;
	string input;
	cin >> input;

	for (int i = 0; input[i] != '\0'; i++)
	{
		charCount++;
		if (input[i] == 'c' && input[i + 1] == '='
			|| input[i] == 'c' && input[i + 1] == '-'
			|| input[i] == 'd' && input[i + 1] == '-'
			|| input[i] == 'l' && input[i + 1] == 'j'
			|| input[i] == 'n' && input[i + 1] == 'j'
			|| input[i] == 's' && input[i + 1] == '='
			|| input[i] == 'z' && input[i + 1] == '=')
		{
			i++;
		}
		else if (input[i] == 'd' && input[i + 1] == 'z')
		{
			if (input[i + 2] == '=')
			{
				i += 2;
			}
		}
	}

	cout << charCount << endl;
	return;
}