Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
20178 | 2024-05-21 01:22:18 | iupc01 | MU CSE Fest 23 Balloon Challenge | C++ 17 | 2 ms | 3332 kb | Accepted |
Source Code
#include <bits/stdc++.h> using namespace std; int main() { int T; cin >> T; for (int t = 1; t <= T; ++t) { int N; cin >> N; string B; cin >> B; int countR = 0, countG = 0, countB = 0; for (char balloon : B) { if (balloon == 'R') countR++; else if (balloon == 'G') countG++; else if (balloon == 'B') countB++; } if (countR == countG && countG == countB) { cout << "Case " << t << ": Harmonious" << endl; } else { cout << "Case " << t << ": Not Harmonious" << endl; } } return 0; }