辅导c数据结构程序、c语言调试、辅导Java、c设计调试、解析c编程、c解析

#include
#include
#include
#include
#define MAX 1000
int main() {
int startpt, endpt; //
double startH, endH; //
int cdnum; //
int i;
FILE *fp;
fp = fopen("C:/Users/wxx53/Desktop/shuce/leveldata.txt", "r");
fscanf(fp, "%d %lf", startpt, startH); //
fscanf(fp, "%d %lf", endpt, endH); //
fscanf(fp, "%d", cdnum); //
struct Shuju
{
int num; //
int startnum; //
int endmum; //
float longh; //
float realh; //
float gaiC; //
float gaiH; //
}shuju[100];
double bihecha; //
double xiancha; //
float sum; //
sum = 0;
bihecha = endH - startH;
for (i = 0; i xiancha)
fprintf(fp0, "：NO/n");
else
{
fprintf(fp0, "：YES/n");


double ** a;
a = (double**)malloc(cdnum * sizeof(double*));
for (int i = 0; i {
a[i] = (double*)malloc(cdnum * sizeof(double));
}
for (int i = 0; i {
for (int j = 0; j {
if (i == 0)
a[i][j] = 1;
else
a[i][j] = 0;
}
}
for (i = 0; i {
for (int j = 0; j printf("%f ", a[i][j]);
printf("\n");
}

double ** q;
q = (double**)malloc(cdnum * sizeof(double*));
for (int i = 0; i q[i] = (double*)malloc(cdnum * sizeof(double));
}
for (int i = 0; i {
for (int j = 0; j {
if (i == j)
q[i][j] = 1/shuju[j].longh;
else
q[i][j] = 0.0;
}
}
for (i = 0; i {
for (int j = 0; j printf("%f ", q[i][j]);
printf("\n");
}
int line1 = 1;
double arr3[MAX][MAX];
int i, j, k;
float ret;
for (i = 0; i < 1; i++)
for (j = 0; j < cdnum; j++)
{
arr3[i][j] = 0;
for (k = 0; k < cdnum ; k++)
arr3[i][j] += a[i][k] * q[k][j];
}
for (i = 0; i < 1; i++)
{
for (j = 0; j < cdnum; j++)
printf("%f ", arr3[i][j]);
}




}

system("pause");
fclose(fp);
fclose(fp0);
return 0;
}