BEE/URI problem no 1181 solution in C
#include<stdio.h>
int main(){
double M[12][12],sum = 0.0;
int i,j,L;
char x[2];
scanf("%d", &L);
scanf("%s", x);
for(i = 0; i < 12; i++){
for(j = 0; j < 12; j++){
scanf("%lf", &M[i][j]);
}
}
for(i = 0; i < 12; i++){
sum += M[L][i];
}
if(x[0] == 'S'){
printf("%.1lfn", sum);
}else if(x[0] == 'M'){
printf("%.1lfn", sum/12.0);
}
return 0;
}