zoukankan      html  css  js  c++  java
  • 胡明浩 160809313

    #include<stdio.h>
    int main()
    {    
        printf("*
    ");
        printf("**
    ");
        printf("***
    ");
        printf("****
    ");
        printf("*****
    ");
        printf("******
    ");
        printf("*******
    ");
        printf("********
    ");
        printf("*********
    ");
        printf("**********
    ");
    }
    #include<stdio.h>
    int main()
    {
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
        printf("**********
    ");
    }
    #include<stdio.h>
    #include<stdio.h>
    int main()
    {
        

    char grade; printf("请输入等级:"); scanf("%c",&grade); switch(grade) { 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; default: printf("输入有误"); break; } return 0; }
    int main()
    {
        printf("**********
    ");
        printf("*********
    ");
        printf("********
    ");
        printf("*******
    ");
        printf("******
    ");
        printf("*****
    ");
        printf("****
    ");
        printf("***
    ");
        printf("**
    ");
        printf("*
    ");
    }
    #include<stdio.h>
    int main()
    {
        double F;
        printf("请输入华氏温度:
    ");
        scanf("%lf", &F);
        printf("C = %0.2lf
    ", 5*(F-32)/9);
        return 0;
    }
    #include<stdio.h>
    int main()
    {
        double height;
        int t=3;
        height=0.5*9.8*t*t;
        printf("height=%.2f
    ",height);
    }
    #include<stdio.h>
    int main()
    {
       int a,b,c,x;
        x=152;
        a=x%10;
        b=(x/10)%10;
        c=x/100;
       printf("整数152的个位数字是%d,十位数字是%d,百位数字是%d
    ",a,b,c);
      
     }
    #include<stdio.h>
    #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);
    }
    #include<stdio.h>
    #include<math.h>
    int maim ()
    {
        double m;
        double y;
        double r;
        double i;
        scanf("%lf,%lf,%lf,%lf",m,y,r,i);
        printf("interesr=%f",i=m*(1+r,y)-m);
    }
    #include<stdio.h>
    #include<math.h>
    int main ()
     {
         double x;
        double cost;
         printf("输入x的值"); 
        scanf("%lf",&x);
        if (x>0&&x<=50)
        printf("cost=%f",cost=0.53*x);
        else if(x>50)
        printf("cost=%f",cost=50*0.53+(x-50)*0.58);
        else 
        printf("Invalid Valuel");
        
     }
  • 相关阅读:
    UVALive-8077 Brick Walls 找规律
    UVALive-8079 Making a Team 排列组合公式化简
    UVALive-8072 Keeping On Track 树形dp 联通块之间缺失边的个数
    HDU-5534 Partial Tree 完全背包 设定初始选择
    HDU-2844 Coins 多重背包 物品数量二进制优化
    CodeForces-366C Dima and Salad 对01背包的理解 多个背包问题
    HDU-2955 Robberies 浮点数01背包 自变量和因变量位置互换
    UVALive-7197 Axles 动态规划 多个背包问题
    广义表(C++实现)
    稀疏矩阵及稀疏矩阵的压缩存储
  • 原文地址:https://www.cnblogs.com/160809313-hmh/p/5920807.html
Copyright © 2011-2022 走看看