8 条题解

  • 0
    @ 2025-1-10 23:12:41

    #include <stdio.h> int main() { int a,b,c,max; scanf("%d %d %d",&a,&b,&c); if (a>b){ max=a; }else { max=b; } if (c>a) { max=c; }else { max=a; } if (b>c) { max=b; }else { max=c; } printf("%d",max); return 0; }

    • 0
      @ 2025-1-10 23:04:52

      #include<stdio.h> int main() { int a,b,c; scanf("%d %d %d",&a,&b,&c); int max=a; if(b>max&&b>c) { printf("the max value is:%d",b); }else if(c>max&&c>b) { printf("the max value is:%d",c); }else{ printf("the max value is:%d",a); } return 0; }

      • 0
        @ 2024-11-26 17:50:08

        #include <stdio.h> int main(){ int a,b,c; int max(int x, int y); scanf("%d %d %d",&a,&b,&c); printf("%d",max(max(a,b),c)); return 0; } int max(int x, int y){ return x>y?x:y; }

        • 0
          @ 2024-8-19 16:55:57

          #include<stdio.h> int main() { int a,b,c; // printf ("输入a,b,c:"); scanf("%d %d %d",&a,&b,&c); int max; max=(a>b)?(b>c?a:(a>c?a:c)):(b<c?c:b); printf("%d",max); return 0;

          }

          • 0
            @ 2023-10-9 20:47:53
            #include<iostream>
            #include<algorithm>
            using namespace std;
            int main(){
                int a,b,c;
                scanf("%d%d%d",&a,&b,&c);
                cout<<""<<max({a,b,c})<<endl;
            }
            
            • 0
              @ 2023-9-20 22:55:05

              #include<stdio.h> int main() { int a,b,c; scanf("%d %d %d",&a,&b,&c); if(a>b) { if (a>c) printf("%d",a); else printf("%d",c); } else {if(b>c) printf("%d",b); else printf("%d",c);} return 0; }

              • 0
                @ 2023-8-22 22:59:02

                #include<stdio.h> int main() { int j,k,l,max; scanf("%d %d %d",&j,&k,&l); max=j>k?(j>l?j:l):(k>l?k:l); printf("%d",max); return 0; }//练练三目

                • 0
                  @ 2023-8-19 21:20:26

                  #include <stdio.h> int main() { int a,b,c,max; scanf("%d %d %d",&a,&b,&c); if (a>b){ max=a; }else { max=b; }if (c>a){ max=c; }else { max=a; }if (b>c){ max=b; }else { max=c; }

                  printf("%d",max);
                  return 0;
                  

                  }

                  • 1

                  信息

                  ID
                  112
                  时间
                  1000ms
                  内存
                  256MiB
                  难度
                  3
                  标签
                  (无)
                  递交数
                  965
                  已通过
                  523
                  上传者