• 20131020 作业 3 利用分支与循环结构解决问题


    1.

    #include<stdio.h>
    int main(void)
    {
        int x,y;
        printf("Enter x:
    ");
        scanf("%d",&x);
        if(x<0){
          y = -1;
        }
        else if(x==0){
          y=0;
        }
        else{
    
            y=1;
            
        }
       printf("y=%d
    ",y); 
       return 0;
    }

    2.

    #include<stdio.h>
    int main (void)
    {
        int count,i,n;
        double grade,total;
    
        printf("Enter n:");
        scanf("%d",&n);
        total=0;
        count=0;
        for(i=1;i<=n;i++){
            printf("Enter grade#%d:",i);
            scanf("%Lf",&grade);
            total=total+grade;
            if(grade>=60){
                count++;
            }
        }
        printf("Grade average=%.2f
    ",total/n);
        printf("Number of failures=%d
    ",count);
        
        return 0;
    }

    3.

    #include<stdio.h>
    int main(void)
    {
        int blank,digit,other,letter;
        char ch;
        int i;
        blank=digit=other=letter=0;
        printf("Enter 15 characters :");
        for(i=1;i<=15;i++){
        ch=getchar( );
        if((ch>='A'&&ch<='Z')||(ch>='a'&&ch<='z'))
            letter++;
        else if(ch>='0'&&ch<='9')
            digit++;
        else if(ch>=' '&&ch<=' ')
    
    
            blank++;
        else
            other++;
        }
    
    printf("blank=%d,digit=%d,letter=%d,other=%d
    ",blank,digit,letter,other);
        return 0;
    }


    4.

    #include<stdio.h>
    int main(void)
    {
        int i,n,year;
        printf("Enter n:");
        scanf("%d",&n);
        for(i=1;i<=n;i++){
            printf("Enter year
    :");
            scanf("%d",&year);
            if((year%4==0&&year%100!=0)||(year%400==0)){
                printf("没有错,这是闰年~
    ");
            }
            else{
                printf("很可惜,这不是闰年~
    ");
            }
        }
    
    
            return 0;
    
        }

    5.

    #include<stdio.h>
    int main(void)
    {
        char op;
        printf("输入成绩等级:");
        scanf("%c",&op);
        switch(op){
            case'A':printf("grade=90-100");
                break;
            case'B':printf("grade=80-89");
                break;
            case'C':printf("grade=70-79");
                break;
            case'D':printf("grade=60-69");
                break;
            case'E':printf("grade=0-59");
                break;
        }
        return 0;
    }

    6.

    #include<stdio.h>
    int main(void)
    {
        int choice,i;
        double price;
        for(i=1;i<=5;i++){
            printf("[1]select apples
    ");
            printf("[2]select pears
    ");
            printf("[3]select oranges
    ");
            printf("[4]select grapes
    ");
            printf("[0]select Exit
    ");
            printf("Enter choice:");
            scanf("%d",&choice);
            if(choice==0)
                break;
            switch(choice){
                   case 1:price= 3.00;break;
                   case 2:price=2.50;break; 
                   case 3:price=4.10;break; 
                   case 4:price=10.20;break;
                default:price=0.00;break;
                }
                printf("price=%0.2f
    ",price);
            }
            printf("Thanks
    ");
            return 0;
        }

  • 相关阅读:
    Drcom账户管理Server端解说
    Hadoop常见异常及其解决方式
    PHP 获取网络接口文件流
    【刷题小记67】三角形面积
    Tiny语言编译器简单介绍
    矩阵十题【六】 poj3070 Fibonacci
    函数名称
    设计模式--6大原则--开闭原则
    LeetCode96:Unique Binary Search Trees
    [Swift]LeetCode958. 二叉树的完全性检验 | Check Completeness of a Binary Tree
  • 原文地址:https://www.cnblogs.com/baojunchi/p/3379574.html
Copyright © 2020-2023  润新知