9 条题解

  • 1
    @ 2024-11-19 20:08:26

    #include <stdio.h> int main() { int i=1,n,max,min; scanf("%d",&n); int a[n]; while(i<=n){scanf("%d",&a[i]);i++;} i=1; while(i<=n) { max=(max>=a[i])?max:a[i]; min=(min<=a[i])?min:a[i]; i++; } printf("%d %d",min,max); return 0; }//

    • 1
      @ 2024-4-24 22:11:55
      #include <stdio.h>
      int main()
      {
          int i=1,n,max,min;
          scanf("%d",&n);
          int a[n];
          while(i<=n){scanf("%d",&a[i]);i++;}
          i=1;
          while(i<=n)
          {
              max=(max>=a[i])?max:a[i];
              min=(min<=a[i])?min:a[i];
              i++;
          }
          printf("%d %d",min,max);
          return 0;
      }//
      
      • 0
        @ 2024-11-23 19:43:27

        #include <stdio.h> int main() { int n,i; int str[10000]; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d ",&str[i]); } … { if(str[i]<min) min=str[i]; } printf("%d %d",min,max); return 0; }

        • 0
          @ 2023-10-28 16:25:55

          #include<stdio.h> int main() { int a[1000]; int i,n,max,min; scanf("%d",&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } max=a[0]; min=a[0]; for(i=1;i<n;i++) { if(max<a[i]) { max=a[i]; } if(min>a[i]) { min=a[i]; } } printf("%d %d",min,max); return 0; }

          • 0
            @ 2023-8-20 23:01:07
            int main()
            { int n, i;
            int max, min;
            scanf("%d",&n);
            int a[n];
            for(i=0;i<n;i++)
            {
            scanf("%d",&a[i]);
            max=a[0];
            min=a[0];
            }
            for(i=1;i<n;i++)
            {
            if(a[i]>max) max=a[i];
            if(a[i]<min) min=a[i];
            }
            printf("%d %d",min,max);
            return 0;
            }
            ```
            
            • 0
              @ 2023-8-9 21:08:18
              #include<iostream>
              using namespace std;
              int main() {
                  int n;
                  cin >> n;
                  int themax = -999999, themin = 999999;
                  while (n--) {
                      int temp;
                      cin >> temp;
                      themax = max(themax, temp);
                      themin = min(themin, temp);
                  }
                  cout << themin << " " << themax;
              }
              
              • 0
                @ 2023-7-28 2:30:17

                你们写题解不用代码块的吗

                #include<iostream>
                using namespace std;
                int main() {
                    int n;
                    cin >> n;
                    int themax = -10001, themin = 10001;
                    while (n--) {
                        int temp;
                        cin >> temp;
                        themax = max(themax, temp);
                        themin = min(themin, temp);
                    }
                    cout << themin << " " << themax;
                }
                
                • 0
                  @ 2022-10-12 22:56:06

                  #include <stdio.h> int main() { int n, i; int max, min; scanf("%d",&n); int a[n]; for(i=0;i<n;i++) { scanf("%d",&a[i]); max=a[0]; min=a[0]; } for(i=1;i<n;i++) { if(a[i]>max) max=a[i]; if(a[i]<min) min=a[i]; } printf("%d %d",min,max); return 0; }

                  • 0
                    @ 2022-9-25 23:23:10

                    #include<stdio.h> int main(){

                    int n;

                    scanf("%d",&n); int s[n]; scanf("%d",&s[0]); int min=s[0],max=s[0]; for(int i=1;i<n;i++) {scanf("%d",&s[i]); if(min>s[i])min=s[i]; if(max<s[i])max=s[i];} printf("%d %d",min,max); return 0; }

                    • 1

                    信息

                    ID
                    29
                    时间
                    1000ms
                    内存
                    128MiB
                    难度
                    7
                    标签
                    递交数
                    6575
                    已通过
                    1580
                    上传者