• 第12次作业王重阳160809311


    #include<stdio.h>//定义结构体类型
    struct student{
         char number[50],name[50],gender[50],dept[50];
         int age,phonenum,score;
    }; 
    int main()
    {
        
    return 0;    
    }
    #include<stdio.h>
    struct student
    {
        char sno[10];
        char sname[20];
        int age;
        char tel[11];
        int score;
    }; 
    
    int main()
    {
        student class3[31];
        int i;
        for(i=0;i<31;i++)
              scanf("%s%s%d%s%d",class3[i].sno,class3[i].sname,&class3[i].age,class3[i].tel,&class3[i].score);
        for(i=0;i<31;i++)
              printf("%s %s %d %s %d
    ",class3[i].sno,class3[i].sname,class3[i].age,class3[i].tel,class3[i].score);
        return 0;
    }
    #include<stdio.h>
    struct student{
        char number[10];
        char name[20];
        int age;
    }; 
    void add()
    {
        student class3;char ch;
        FILE *fp=fopen("g:\student.txt","a+");
        printf("请输入学号:");
        scanf("%s",class3.number);
        printf("请输入姓名:");
        scanf("%s",class3.name);
        printf("请输入年龄:");
        scanf("%d",&class3.age);
        fprintf(fp,"%s    %s    %d
    ",class3.number,class3.name,class3.age);
        printf("信息添加成功,是否继续添加学生信息(y/n)");
        scanf("%s",&ch);
        do
        {
            printf("请输入学号:");
            scanf("%s",class3.number);
            printf("请输入姓名:");
            scanf("%s",class3.name);
            printf("请输入年龄:");
            scanf("%d",&class3.age);
            fprintf(fp,"%s    %s    %d
    ",class3.number,class3.name,class3.age);
            printf("信息添加成功,是否继续添加学生信息(y/n)");
            scanf("%s",&ch);
        }while(ch=='y' || ch=='Y');
    }
    int main()
    {
        printf("                    学生管理系统
    ");
        printf("1.添加学生信息
    "); 
        printf("2.其他功能。。。
    ");
        printf("请选择(只能选1....):
    ");
        int a;
        scanf("%d",&a);
        if(a==1)
            add();     
        return 0;
    }
  • 相关阅读:
    83. Remove Duplicates from Sorted List
    35. Search Insert Position
    96. Unique Binary Search Trees
    94. Binary Tree Inorder Traversal
    117. Populating Next Right Pointers in Each Node II
    116. Populating Next Right Pointers in Each Node
    111. Minimum Depth of Binary Tree
    169. Majority Element
    171. Excel Sheet Column Number
    190. Reverse Bits
  • 原文地址:https://www.cnblogs.com/160809311-wcy/p/6185566.html
Copyright © 2020-2023  润新知