5.6 IO作业

最新推荐文章于 2024-07-24 19:35:30 发布

Young2109

最新推荐文章于 2024-07-24 19:35:30 发布

阅读量368

点赞数 6

文章标签： c语言算法 vim 数据结构

本文链接：https://blog.csdn.net/Young2109/article/details/138508707

版权

1.主要函数

typedef struct Student{
    char name[16];
    int age;
    double math_score;
    double chinese_score;
}Stu,*stu_p;
int main(int argc, const char *argv[])
{
    stu_p H[5];int i=0;
    for(i=0;i<5;i++){
        H[i]=(stu_p)malloc(sizeof(Stu));
        scanf("%s %d %lf %lf",H[i]->name,&(H[i]->age),&(H[i]->math_score),&(H[i]->chinese_score));
    }
    FILE* fp=fopen("1.txt","w");
    for(i=0;i<5;i++){
        fprintf(fp,"%s %d %lf %lf\n",H[i]->name,H[i]->age,H[i]->math_score,H[i]->chinese_score);
    }
    fclose(fp);

    FILE* fp1=fopen("1.txt","r");
    stu_p G[5];
    for(i=0;i<5;i++){
        G[i]=(stu_p)malloc(sizeof(Stu));
        fscanf(fp1,"%s %d %lf %lf",G[i]->name,&(G[i]->age),&(G[i]->math_score),&(G[i]->chinese_score));
        printf("%s %d %lf %lf\n",G[i]->name,G[i]->age,G[i]->math_score,G[i]->chinese_score);
    }
    fclose(fp1);
    for(i=0;i<5;i++){  
        free(H[i]);  
        free(G[i]);  
    }  
    return 0;
}

2.实现示例