



1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 | #include <iostream> using namespace std; int main() { int N; int count = 0; string word; cin >> N; for (int i = 0; i < N; i++) { cin >> word; int size = word.length(); bool check = true; for (int j = 0; j < size; j++) { for (int k = 0; k < j; k++) { if (word[j] != word[j – 1] && word[j] == word[k]) { check = false; break; } } } if (check) count++; } cout << count; return 0; } | cs |