Uri/Beecrowd Problem no - 1184 solution in C
Code Solution in C for Uri/Beecrowd Problem 1184
#include <stdio.h>
int main() {
double M[12][12];
char O;
double sum = 0.0;
int i, j, count = 0;
scanf("%c", &O);
for (i = 0; i < 12; i++) {
for (j = 0; j < 12; j++) {
scanf("%lf", &M[i][j]);
if (j < i) {
sum += M[i][j];
count++;
}
}
}
if (O == 'S') {
printf("%.1lf\n", sum);
} else if (O == 'M') {
printf("%.1lf\n", sum / count);
}
return 0;
}