https://www.dbpia.co.kr/journal/articleDetail?nodeId=NODE11138457

#include <stdlib.h>

#include <math.h>

#pragma warning(disable:4996)

float b[4];

float c[4];

float t[4];

int main(){

float **a;

int n;

int n2;

scanf("%d",&n);

scanf("%d",&n2);

char **str;

a=(float**)malloc(sizeof(float*)*(n));

for(int i=0;i<n;i++){

a[i]=(float*)malloc(sizeof(float)*(n2+1));

}

str=(char**)malloc(sizeof(char*)*(n));

for(int i=0;i<n;i++){

str[i]=(char*)malloc(sizeof(char)*(50));

}

FILE *fp = fopen("MedStat07_2.txt", "rt");

if(fp == NULL){

printf("fail");

}

for(int i = 0; i < n2; i++){

for(int j = 0; j <n; j++){

if(i == 0){

fscanf(fp, "%s", str[j]);

}

else{

fscanf(fp, "%f", &a[j][i]);

}

}

}

for(int i = 0; i < n2 ; i++){

for(int j = 0; j < n; j++){

if(i == 0){

printf("%s ", str[j]);

}

else{

printf("%f ", a[j][i]);

}

}

printf("\n");

}

float f1, f2, f3;

scanf("%f %f %f", &f1, &f2, &f3);

// 평균

int sum = 0;

for(int y = 1; y < n2; y++){

if(a[1][y] == f1){

if(a[2][y] == f2){

if(a[3][y] == f3){

sum++;

for(int i = 0; i < 4; i++){

b[i] += a[5 + 2*i][y] - a[6 + 2*i][y];

printf("debugging: %f \n",b[i]);

}

}

}

}

}

// 표준편차

for(int y = 1; y < n2; y++){

if(a[1][y] - f1 == 0){

if(a[2][y] - f2 == 0){

if(a[3][y] - f3== 0){

for(int i = 0; i < 4; i++){

c[i] += pow(b[i] - a[5 + 2*i][y] + a[6 + 2*i][y], 2);

}

}

}

}

}

for(int i = 0; i < 4; i++){

c[i] = pow(c[i] / (sum-1), 1/2);

}

for(int i = 0; i < 4; i++){

t[i]=b[i]/c[i]*pow(sum,1/2);

printf("\n answer : %f \n", t[i]);

}

fclose(fp);

return 0;

}