实验7

task4

代码

#include<stdio.h>

int main(){
    char ch;
    int count=0;
    FILE *fp;
    
    fp=fopen("C:\\Users\\admin\\Desktop\\博客园\\实验7\\data4.txt","r");
    if(fp==NULL){
        printf("error\n");
        return 1;
    }
    
    while(!(feof(fp))){
        ch=fgetc(fp);
        if(ch==' '||ch=='\n'){
            continue;
        }
        if(ch==EOF){
            break;
        }
        count++;
    }
24　　　fclose(fp);
    printf("data4.txt中共包含字符数（不计空白字符）:%d",count);
    return 0; 
}

结果

 

task5

代码

#include <stdio.h>
#include <string.h>
#include <stdlib.h>

#define N 10

typedef struct {
    long int id;
    char name[20];
    float objective;    
    float subjective;   
    float sum;          
    char ans[10];       
} STU;

void finput(STU st[], int n);
void foutput(STU st[], int n);
void output(STU st[], int n);
int process(STU st[], int n, STU st_pass[]);

int main() {
    STU stu[N], stu_pass[N];
    int cnt;
    double pass_rate;

    printf("从文件读入%d个考生信息...\n", N);
    finput(stu, N);

    printf("\n对考生成绩进行统计...\n");
    cnt = process(stu, N, stu_pass);

    printf("\n通过考试的名单:\n");
    output(stu, N);      
    foutput(stu, N);   

    pass_rate = 1.0 * cnt / N;
    printf("\n本次等级考试通过率: %.2f%%\n", pass_rate*100);

    return 0;
}

void output(STU st[], int n) {
    int i;
    
    printf("准考证号\t姓名\t客观题得分\t操作题得分\t总分\t\t结果\n");
    for (i = 0; i < n; i++)
        printf("%ld\t\t%s\t%.2f\t\t%.2f\t\t%.2f\t\t%s\n", st[i].id, st[i].name, st[i].objective, st[i].subjective, st[i].sum, st[i].ans);
}

void finput(STU st[], int n) {
    int i;
    FILE *fin;

    fin = fopen("examinee.txt", "r");
    if (fin == NULL) {
        printf("fail to open file\n");
        exit(0);
    }

    while (!feof(fin)) {
        for (i = 0; i < n; i++)
            fscanf(fin, "%ld %s %f %f", &st[i].id, st[i].name, &st[i].objective, &st[i].subjective);
    }

    fclose(fin);
}

void foutput(STU s[], int n) {
    FILE *fout;
    int i;
    
    fout = fopen("list_pass.txt", "w");
    if (!fout) {
        printf("fail to open or create list_pass.txt\n");
        exit(0);
    }
    
    fprintf(fout, "准考证号\t\t姓名\t客观题得分\t操作题得分\t总分\t\t结果\n");

    for (i = 0; i < n; i++)
        fprintf(fout, "%ld\t\t%s\t%.2f\t\t%.2f\t\t%.2f\t\t%s\n", s[i].id, s[i].name, s[i].objective, s[i].subjective, s[i].sum, s[i].ans);

    fclose(fout);
}

int process(STU st[], int n, STU st_pass[]) {
    int i,cnt=0;
    for(i=0;i<n;i++){
        st[i].sum=st[i].objective+st[i].subjective;
        
        if(st[i].sum>=60){
            strcpy(st[i].ans,"pass");
            cnt++;
        }else{
            strcpy(st[i].ans,"fail");
        }
    }
    return cnt;
}

 

结果

 

task6(必做和选做(❁´◡`❁))

代码

 

#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<time.h>
#define N 80

typedef struct{
    int hao;
    char name[N];
    char ban[N];
}stu; 

void finput(stu st[],int n);
void foutput(stu s[]);
void sui(stu st[],stu s[]);
void sort(stu s[]);

int main(){
    stu st[N],s[5];
    finput(st,N);
    sui(st,s);
    sort(s);
    foutput(s);
    
    return 0;
}

void finput(stu st[],int n){
    FILE *fp;
    int i;
    
    fp=fopen("list.txt","r");
    if(fp==NULL){
        printf("fail to open\n");
        exit(0);
    }
    while(!feof(fp)){
        for(i=0;i<n;i++){
            fscanf(fp,"%d %s %s",&st[i].hao,st[i].name,st[i].ban);
        }
    }
    
    fclose(fp);
}

void foutput(stu s[]){
    FILE *fout;
    int i;
    char filename[20];
    struct tm *local_time;
    time_t now;
    
    time(&now);
    local_time = localtime(&now);
    
    strftime(filename,sizeof(filename),"%Y%m%d.txt",local_time);
    
    fout = fopen(filename,"w");
    if(!fout){
        printf("fail");
        exit(0);
    }
    
    for(i=0;i<5;i++){
        fprintf(fout,"%d\t\t%s\t%s\n",s[i].hao,s[i].name,s[i].ban);
        printf("%d\t\t%s\t%s\n",s[i].hao,s[i].name,s[i].ban);
    }
    
    fclose(fout);
}

void sui(stu st[],stu s[]){
    srand(time(0));
    int total[N];
    int i;
    for(i=0;i<5;i++){
        int t=rand()%80+1;
        if(total[t]==1){
            i--;
            continue;
        }
        total[t]=1;
        s[i]=st[t];
    }
    
}

void sort(stu s[]){
    int i,j;
    stu temp;
    char p[N];
    for(i=0;i<5;i++){
        for(j=i+1;j<5;j++){
            if(s[j].hao<s[i].hao){
                temp=s[i];
                s[i]=s[j];
                s[j]=temp;
            }
        }
    }
}

 

结果