zoukankan      html  css  js  c++  java
  • 作业12

    #include<stdio.h>
    #include<string.h>
    int main()
    {
        int i,max;
        char sx[20];
        for(i=0;i<5;i++){        
            gets(sx);
            if(i>0)
                max=strcmp(sx-1,sx);
        }
        if(max==-1)
            printf("%s",sx);
        return 0;
    }
    #include<stdio.h>
    #include<string.h>
    int main()
    {
        char sx[20];
        int i,big,small,num,blank,other;
        big=small=num=blank=other=0;
        gets(sx);
        for(i=0;i<strlen(sx);i++){
            if(sx[i]>='A'&&sx[i]<='Z')
                big++;
            else if(sx[i]>='a'&&sx[i]<='z')
                small++;
            else if(sx[i]>='0'&&sx[i]<='9')
                num++;
            else if(sx[i]==' ')
                blank++;
            else
                other++;
        } 
        printf("大写字母有%3d个
    小写字母有%3d个
    空格有%3d个
    数字有%3d个
    其他字符有%3d个
    ",big,small,num,blank,other);
        return 0;
    } 
    #include<stdio.h>
    #include<string.h>
    struct student_list{
        char name[10];
        int point1;
        int point2;
        int point3;
        char number[10];
    };
    int count=0;
    void search_student(struct student_list students[],char *name);
    void new_student(struct student_list students[]);
    void printf_student(struct student_list students[]);
    void average_student(struct student_list students[],double average);
    int main()
    {
        int choice;
        double average;
        char name[10];
        struct student_list students[50]; 
        do{
            printf("******学生信息管理系统*******
    ");
            printf("	1:新建
    ");
            printf("	2:查询
    ");
            printf("	3:输出
    ");
            printf("	4:平均成绩
    ");
            printf("	0:退出
    ");
            printf("请选择功能:");
            scanf("%d",&choice);
            switch(choice){
                case 1:
                    new_student(students);
                    break;
                case 2:
                    printf("请输入要查找的学生姓名:");
                    scanf("%s",name);
                    search_student(students,name);
                    break;
                case 3:                
                    printf_student(students);
                    break;
                case 4:
                    average_student(students,average);
                case 0:
                    break; 
            }        
        }while(choice!=0);
    }
    void new_student(struct student_list students[])
    {
        int i;
        struct student_list s;
        if(count==50)
            printf("学生系统数据已满!");
        printf("请输入学生姓名:");
        scanf("%s",s.name);
        printf("请输入学生学号:");
        scanf("%s",s.number);
        printf("请输入学生三科成绩:");
        scanf("%d%d%d",&s.point1,&s.point2,&s.point3);
        students[count]=s;
        count++;
    }
    void printf_student(struct student_list students[])
    {
        printf("系统中学生为:");
        int i;
        for(i=0;i<count;i++){
            printf("%s   %s   %d %d %d",students[i].name,students[i].number,students[i].point1,students[i].point2,students[i].point3);    
        }
                
    }
    void search_student(struct student_list students[],char *name)
    {
        int i,a=0;
        if(count==0){
            printf("系统内无信息。");
            return;
        } 
        for(i=0;i<count;i++)
            if(strcmp(name,students[i].name)==0){
                a=1;
                break;
            }             
        if(a==1){
            printf("姓名:%s	",students[i].name);
            printf("学号:%s	",students[i].number);
            printf("分数:%d %d %d
    ",students[i].point1,students[i].point2,students[i].point3);
        }
    }
    void average_student(struct student_list students[],double average)
    {
        int i;
        for(i=0;i<count;i++)
            average=(students[i].point1+students[i].point2+students[i].point3)/3;
        printf("平均成绩=%.2lf
    ",average);
        return;
    }
  • 相关阅读:
    HDU 1874 畅通工程续(dijkstra)
    HDU 2112 HDU Today (map函数,dijkstra最短路径)
    HDU 2680 Choose the best route(dijkstra)
    HDU 2066 一个人的旅行(最短路径,dijkstra)
    关于测评机,编译器,我有些话想说
    测评机的优化问题 时间控制
    CF Round410 D. Mike and distribution
    数字三角形2 (取模)
    CF Round410 C. Mike and gcd problem
    CF Round 423 D. High Load 星图(最优最简构建)
  • 原文地址:https://www.cnblogs.com/ly6251/p/6182985.html
Copyright © 2011-2022 走看看