[C++]백준 알고리즘 1316번

풀이는 아래와 같다.

#include <iostream>
#include <string>
 
using namespace std;
 
int main()
{
    int n;
    cin >> n;
    
    string word[100];
    int check[26];
    for(int k=0; k<26; k++){
        check[k] = 0;
    }
    
    for(int i=0; i<n; i++){
        cin >> word[i];
    }
    
    int count = 0;
    for(int i=0; i<n; i++){
        for(int k=0; k<26; k++){
            check[k] = 0;
        }
        bool break_out = false;
        for(int j=0; j<word[i].length(); j++){
            if(check[word[i][j]-'a'] == 0){
                if(j<word[i].length()-1 && word[i][j+1] == word[i][j]){
                    check[word[i][j]-'a'] = 0;
                }else{
                    check[word[i][j]-'a'] = 1;
                }
            }else{
                break_out = true;
                break;
            }
        }
        if(break_out == true){
            continue;
        }
        count++;
    }
    
    cout << count << '\n';
    return 0;
}