zoukankan      html  css  js  c++  java
  • 补交第三次作业

    #include<stdio.h>//1.三角形
    int main()
    {
        
        printf("*
    ");
        printf("**
    ");
        printf("***
    ");
        printf("****
    ");
        printf("*****
    ");
        printf("******
    ");
        printf("*******
    ");
        printf("********
    ");
        printf("*********
    ");
        printf("**********
    ");
        
    }
    #include<stdio.h>//2.十行矩形 
    int main()
    {
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
    }
    #include<stdio.h>//3.倒三角形 
    int main()
    {
        printf("**********
    ");
        printf("*********
    ");
        printf("********
    ");
        printf("*******
    ");
        printf("******
    ");
        printf("*****
    ");
        printf("****
    ");
        printf("***
    ");
        printf("**
    ");
        printf("*
    ");
    }
    #include<stdio.h> // 4.五级制成绩 
    int main()
    {
        char score;
        scanf("%c",&score);
        switch (score)
        {
            case 'A':
                  printf("90~100");
                  break;
            case 'B':
                  printf("80~89");
                  break; 
            case 'C':
                  printf("70~79");
                  break;
            case 'D':
                  printf("60~69");
                  break;
            case 'E':
                  printf("0~59");
                  break; 
        }   
    }
    #include<stdio.h> //6.100米小球落下 
    #define G 9.8 
    int main()
    {
        int y=3;
        printf("垂直距离是:%.2f
    ",0.5*G*y*y);
        
        
    }
    #include<stdio.h> //7. 显示个位数字,十位数字和百位数字的值。 
    #include<math.h> 
    int main()
    {
        int t[10]={0};
        int a;
        scanf("%d",&a);
        int i=0;
        while(a!=0)
        {
            t[i++]=a%10;
            a=a/10;
        }
        int j;
        for(j=0;j<=i;j++)
             printf("%.0f",(t[j]*pow(10,j)));
    }
    #include<stdio.h>//8.分段函数
    #include<math.h>
    int main ()
    {
        double x;
        double y;
        scanf("%lf",&x);
        if(x>=0)
             y=sqrt(x);
         else
             y=pow(x+1,2)+2*x+1/x;
             printf("f(x)=%f",y);
             
    }
  • 相关阅读:
    [OS] 信号量(Semaphore)
    [OS] 进程互斥
    [剑指Offer] 52.正则表达式匹配
    [剑指Offer] 51.构建乘积数组
    [剑指Offer] 50.数组中重复的数字
    [剑指Offer] 49.把字符串转换成整数
    [剑指Offer] 48.不用加减乘除做加法
    [剑指Offer] 47.求1+2+3+...+n
    PHP知识库图谱汇总(完善中)
    修改thinkphp路由模式,去掉Home
  • 原文地址:https://www.cnblogs.com/kanghui/p/6112177.html
Copyright © 2011-2022 走看看