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 |
Source Code
#include <stdio.h> int main() { int T; for (int i = 1; i <= T; i++) { int N; char B[N + 1]; int countR = 0, countG = 0, countB = 0; for (int j = 0; j < N; j++) { if (B[j] == 'R') countR++; else if (B[j] == 'G') countG++; else if (B[j] == 'B') countB++; } if (countR == countG && countG == countB) else } return 0; }