#include <iostream> #include <algorithm> int main() { std::string input; std::cin >> input; int allBalanced = 0; for (int i = 0; i < input.length(); i++) { for (int j = 1; j <= input.length() - i; j++) { std::string result(input, i, j); size_t a = std::count(result.begin(), result.end(), 'a'); size_t b = std::count(result.begin(), result.end(), 'b'); size_t c = std::count(result.begin(), result.end(), 'c'); bool hasA = !(result.find('a') == std::string::npos); bool hasB = !(result.find('b') == std::string::npos); bool hasC = !(result.find('c') == std::string::npos); if ( ((hasA) && (hasB) && (hasC) && (a == b) && (b == c)) || ((hasA) && (hasB) && (!hasC) && (a == b)) || ((!hasA) && (hasB) && (hasC) && (b == c)) || ((hasA) && (!hasB) && (hasC) && (a == c)) || ((hasA) && (!hasB) && (!hasC)) || ((!hasA) && (hasB) && (!hasC)) || ((!hasA) && (!hasB) && (hasC)) ) { allBalanced += 1; } } } std::cout << allBalanced << "\n"; return 0; }
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 | #include <iostream> #include <algorithm> int main() { std::string input; std::cin >> input; int allBalanced = 0; for (int i = 0; i < input.length(); i++) { for (int j = 1; j <= input.length() - i; j++) { std::string result(input, i, j); size_t a = std::count(result.begin(), result.end(), 'a'); size_t b = std::count(result.begin(), result.end(), 'b'); size_t c = std::count(result.begin(), result.end(), 'c'); bool hasA = !(result.find('a') == std::string::npos); bool hasB = !(result.find('b') == std::string::npos); bool hasC = !(result.find('c') == std::string::npos); if ( ((hasA) && (hasB) && (hasC) && (a == b) && (b == c)) || ((hasA) && (hasB) && (!hasC) && (a == b)) || ((!hasA) && (hasB) && (hasC) && (b == c)) || ((hasA) && (!hasB) && (hasC) && (a == c)) || ((hasA) && (!hasB) && (!hasC)) || ((!hasA) && (hasB) && (!hasC)) || ((!hasA) && (!hasB) && (hasC)) ) { allBalanced += 1; } } } std::cout << allBalanced << "\n"; return 0; } |