Submission
Id | When | Author | Problem | Language | CPU | Memory | Verdict |
---|---|---|---|---|---|---|---|
20178 | 2024-05-21 01:22:18 | iupc01 | MU CSE Fest 23 Balloon Challenge |
|
2 ms | 3332 kb | Accepted |
Test Cases
CPU | Memory | Verdict | |||||||||
---|---|---|---|---|---|---|---|---|---|---|---|
1 | 2 ms | 3256 kb | Accepted | ||||||||
2 | 1 ms | 3272 kb | Accepted | ||||||||
3 | 1 ms | 3328 kb | Accepted | ||||||||
4 | 1 ms | 3260 kb | Accepted | ||||||||
5 | 1 ms | 3280 kb | Accepted | ||||||||
6 | 1 ms | 3328 kb | Accepted | ||||||||
7 | 1 ms | 3332 kb | Accepted | ||||||||
Source Code
program.cpp
#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; }