백준(2941번 크로아티아 알파벳)풀이 C++

www.acmicpc.net/problem/2941

2941번: 크로아티아 알파벳

1) 주석 없는 VERSION

#include <stdio.h>
#include <iostream>
#include <string>
#include <stack>
#include <sstream>
using namespace std;

int main() {
	string word;
	cin >> word;

	int count = 0;

	for (int i = 0;i < word.length();i++) {

		if (word[i] == 'c') {
			if (word[i + 1] == '=') {
				count += 1;
				i++;
			}
			else if (word[i + 1] == '-') {
				count += 1;
				i++;
			}
			else count += 1;
		}

		else if (word[i] == 'd') {
			if (word[i + 1] == 'z') {
				if (word[i + 2] == '=') {
					count += 1;
					i += 2;
				}
				else count += 1;
			}
			else if (word[i + 1] == '-') {
				count += 1;
				i++;
			}
			else count += 1;
		}

		else if (word[i] == 'l') {
			if (word[i + 1] == 'j') {
				count += 1;
				i++;
			}
			else count += 1;
		}

		else if (word[i] == 'n') {
			if (word[i + 1] == 'j') {
				count += 1;
				i++;
			}
			else count += 1;
		}

		else if (word[i] == 's') {
			if (word[i + 1] == '=') {
				count += 1;
				i++;
			}
			else count += 1;
		}

		else if (word[i] == 'z') {
			if (word[i + 1] == '=') {
				count += 1;
				i++;
			}
			else count += 1;
		}

		else count += 1;

	}

	cout << count;
}

2) 주석 있는 VERSION

#include <stdio.h>
#include <iostream>
#include <string>
#include <stack>
#include <sstream>
using namespace std;

int main() {
	string word;
	cin >> word;

	int count = 0;

	for (int i = 0;i < word.length();i++) {

		if (word[i] == 'c') {
			if (word[i + 1] == '=') {
				count += 1; // c= 일때 count 1증가
				i++; // '='이 있는 자리는 넘어가기
			}
			else if (word[i + 1] == '-') {
				count += 1;
				i++;
			}
			else count += 1; // 아닌경우 +1 해주는것 필수
		}

		// 위와 같은 방법으로 케이스 넣어주기
		else if (word[i] == 'd') {
			if (word[i + 1] == 'z') {
				if (word[i + 2] == '=') {
					count += 1;
					i += 2;
				}
				else count += 1;
			}
			else if (word[i + 1] == '-') {
				count += 1;
				i++;
			}
			else count += 1;
		}

		else if (word[i] == 'l') {
			if (word[i + 1] == 'j') {
				count += 1;
				i++;
			}
			else count += 1;
		}

		else if (word[i] == 'n') {
			if (word[i + 1] == 'j') {
				count += 1;
				i++;
			}
			else count += 1;
		}

		else if (word[i] == 's') {
			if (word[i + 1] == '=') {
				count += 1;
				i++;
			}
			else count += 1;
		}

		else if (word[i] == 'z') {
			if (word[i + 1] == '=') {
				count += 1;
				i++;
			}
			else count += 1;
		}

		else count += 1;

	}

	cout << count;
}