[1일 1백준 : 10809번] 알파벳 찾기

 ༼ つ ◕_◕ ༽つ 

#include <iostream>
#include <memory.h>

// a ~ z : 97 ~ 122
// 122 - 97 = 25
int main(void)
{
	const int ENTRY_ANCII_NUMBER = 97, END_ANCII_NUMBER = 122;
	const int MAX_ALPHABET_COUNT = 26;

	int index[MAX_ALPHABET_COUNT];
	memset(index, -1, sizeof(int) * MAX_ALPHABET_COUNT);
	

	std::string word;

	std::cin >> word;

	for (size_t i = ENTRY_ANCII_NUMBER; i <= END_ANCII_NUMBER; i++)
	{
		for (size_t j = 0; j < word.size(); j++)
		{
			int num = (int)word[j];
			if (i == num && index[i % ENTRY_ANCII_NUMBER] == -1) {
				index[i % ENTRY_ANCII_NUMBER] = j;
			}
		}
	}


	for (size_t i = 0; i < MAX_ALPHABET_COUNT; i++)
	{
		std::cout << index[i] << " ";
	}
	return 0;
}

 

 

10809번: 알파벳 찾기 (acmicpc.net)

10809번: 알파벳 찾기