zoukankan      html  css  js  c++  java
  • 第二次实验

    #include<stdio.h>
    int main()
    {
     int a,s,d,f,g;
     putchar(getchar(a));
     putchar(getchar(s));
        putchar(getchar(d));
     putchar(getchar(f));
     putchar(getchar(f));
     putchar(' ');
     return 0;
        
    }

    #include<stdio.h>

    int main()

    { int years;

    printf("input a year:");

    scanf("%d",&years);

    if ((years%4==0&&years%100!=0)||(years%400==0))

    printf("years=%d,months=2,days=28",years);

    else  

    printf("years=%d,months=2,days=29",years);

    printf(" ");

    return 0; }

    #include<stdio.h>

    int main()

    {

    int a,b,c;

    printf("输入三个实数");

    scanf("%d%d%d",&a,&b,&c);

    if (a-b<c&&a-c<b&&b-c<a)

    if (a==b&&b==c&&c==b)  

     printf("此为等边三角形");

       else if ((a==b)||(a==c)||(b==c))

      printf("此为等腰三角形");

     else if((a*a+b*b==c*c)||(a*a==b*b+c*c)||(b*b==c*c+a*a)) 

     printf("此为直角三角形");     else      printf("此为一般三角形");

    }

    else printf("不构成三角形");

    return 0;

    }

    #include<stdio.h>

     int main()

    { double a,rate,tax,profit;

    scanf("%lf",&a);

    if(a<500)

    {rate=0.00;

    profit=a*(1-rate);

    printf("%lf%lf",a,profit,

    rate=0.00);}

    else if(a<1000)

    {rate=0.05;

    profit=a*(1-rate);

    printf("a=%lf profit=%lf rate=0.05",a,profit);}

    else if (a<2000)

    {rate=0.08;

    profit=a*(1-rate);

    printf("a=%lf profit=%lf rate=0.08",a,profit);}

    else if (a<5000) {rate=0.08;

    profit=a*(1-rate);

    printf("a=%lf profit=%lf rate=0.10",a,profit);}

    else  if(a>=5000)

    {rate=0.08;

    profit=a*(1-rate);

    printf("a=%lf profit=%lf rate=0.15",a,profit);}

    printf(" ");

    return 0;

    }

  • 相关阅读:
    模式识别: 线性分类器
    Graph Cuts学习笔记2014.5.16----1
    图像处理程序框架—MFC相关知识点
    图像处理程序框架—MFC相关知识点
    【ML】人脸识别
    【视觉】两个赞的开发文档
    【调研】在总体为n的情况下,多少样本有代表性?
    【ubuntu】upload files
    【git】git pull
    【spark】with mongodb
  • 原文地址:https://www.cnblogs.com/P201821430012/p/10768870.html
Copyright © 2011-2022 走看看