Loading...
Submission
# When Author Problem Language CPU Memory
19956 2024-05-16 21:12:46 AHAMMED_99 MU CSE Fest 23 Balloon Challenge C 0 ms 1540 kb Accepted
Test Cases
# CPU Memory Points
1 0 ms 1436 kb 1 Accepted
2 0 ms 1432 kb 1 Accepted
3 0 ms 1504 kb 1 Accepted
4 0 ms 1496 kb 1 Accepted
5 0 ms 1540 kb 1 Accepted
6 0 ms 1536 kb 1 Accepted
7 0 ms 1456 kb 1 Accepted
Source Code
  1. #include <stdio.h>
  2.  
  3. int main() {
  4. int T;
  5. scanf("%d", &T);
  6.  
  7. for (int i = 1; i <= T; i++) {
  8. int N;
  9. scanf("%d", &N);
  10.  
  11. char B[N + 1];
  12. scanf("%s", B);
  13.  
  14. int countR = 0, countG = 0, countB = 0;
  15.  
  16. for (int j = 0; j < N; j++) {
  17. if (B[j] == 'R')
  18. countR++;
  19. else if (B[j] == 'G')
  20. countG++;
  21. else if (B[j] == 'B')
  22. countB++;
  23. }
  24.  
  25. if (countR == countG && countG == countB)
  26. printf("Case %d: Harmonious\n", i);
  27. else
  28. printf("Case %d: Not Harmonious\n", i);
  29. }
  30.  
  31. return 0;
  32. }
  33.