Submission
# | When | Author | Problem | Language | CPU | Memory | |
---|---|---|---|---|---|---|---|
19947 | 2024-05-16 00:06:16 | AHAMMED_99 | MU CSE Fest 23 Balloon Challenge | C | 0 ms | 1328 kb | Wrong Answer - 1 |
Source Code
#include <stdio.h> #include <string.h> int main() { int T; for (int t = 1; t <= T; t++) { int N; char B[N + 1]; // Adding one for null terminator int countR = 0, countG = 0, countB = 0; for (int i = 0; i < N; i++) { if (B[i] == 'R') countR++; else if (B[i] == 'G') countG++; else if (B[i] == 'B') countB++;} // Checking if counts are equal if (countR == countG && countG == countB) else } return 0; }