zoukankan      html  css  js  c++  java
  • 计算三个数的最大值与最小值

    // HOngT.cpp : 定义控制台应用程序的入口点。
    //

    #include "stdafx.h"
    #define MAX(a,b,c) ((((a>b)?(a):(b))>c)?((a>b)?(a):(b)):(c))
    #define MIN(a,b,c) ((((a<b)?(a):(b))<c)?((a<b)?(a):(b)):(c))

    int _tmain(int argc, _TCHAR* argv[])
    {
    int x,y,z;
    printf("pelease putin your three numbers: \n");
    scanf("%d %d %d",&x,&y,&z);
    printf("MAX = %d\n",MAX(x,y,z));
    printf("MIN = %d\n",MIN(x,y,z));
    return 0;
    }

    以上是用宏设计进行计算的;

    // MAX.cpp : 定义控制台应用程序的入口点。
    //

    #include "stdafx.h"


    int _tmain(int argc, _TCHAR* argv[])
    {
    int x,y,z;
    printf("pelease putin your three numbers: \n");
    scanf("%d %d %d",&x,&y,&z);
    if((x == y) && (x == z)){
    printf("MAX = %d,%d,%d\n",x,y,z);
    printf("MIN = %d,%d,%d\n",x,y,z);}else if((x == y) && (x > z)){
    printf("MAX = %d,%d\n",x,y);
    printf("MIN = %d\n",z);}else if((x == y) && (x < z)){
    printf("MAX = %d\n",z);
    printf("MIN = %d,%d\n",x,y);}else if((x == z) && (x > y)){
    printf("MAX = %d,%d\n",x,z);
    printf("MIN = %d\n",y);}else if((y == z) && (y > x)){
    printf("MAX = %d,%d\n",y,z);
    printf("MIN = %d\n",x);}else if(x>y){
    if(x>z){
    printf("MAX = %d\n",x);if(y>z){
    printf("MIN = %d\n",z);}else{
    printf("MIN = %d\n",y);}}else{
    printf("MAX = %d\n",z);
    printf("MIN = %d\n",y);}}else if(x<y){
    if(y>z){
    printf("MAX = %d\n",y);
    if(x>z){
    printf("MIN = %d\n",z);}else{
    printf("MIN = %d\n",x);}}else{
    printf("MAX = %d\n",z);
    printf("MIN = %d\n",x);}}
    return 0;
    }

    以上是选择语句实现。

  • 相关阅读:
    BZOJ 5297: [Cqoi2018]社交网络 矩阵树定理
    BZOJ 5300: [Cqoi2018]九连环 打表+FFT
    BZOJ 5298: [Cqoi2018]交错序列 二项式定理+矩阵乘法
    BZOJ 5301: [Cqoi2018]异或序列 莫队+桶
    BZOJ 5324: [Jxoi2018]守卫 区间DP
    BZOJ 5322: [Jxoi2018]排序问题 模拟+贪心
    点斜式
    斜截式
    斜率
    求线段的交点
  • 原文地址:https://www.cnblogs.com/chenxiangxi/p/2226194.html
Copyright © 2011-2022 走看看