华为od机试真题 C语言 实现【太阳能板最大面积】

>       1. #include <stdio.h>

>  
>       2. int main()
>  
>       3. {
>  
>       4.     int a,b;
>  
>       5.     scanf("%d %d",&a, &b);
>  
>       6.     printf("%d\n",a+b);  //对其他题目，换成要求的复杂处理与输出
>  
>       7.     return 0;
>  
>       8. }
>  
>  
>  
>  
>     代码解读

>       1. #include <stdio.h>

>  
>       2. int main()
>  
>       3. {
>  
>       4.      int a,b;
>  
>       5.      while(scanf("%d %d",&a, &b) != EOF) // 输入结束时，scanf函数返回值为EOF(-1)，即没有数据输入时会退出while循环
>  
>       6.      {
>  
>       7.              printf("%d\n",a+b);
>  
>       8.      }
>  
>       9.      return 0;
>  
>       10. }
>  
>  
>  
>  
>     代码解读

>       1. #include<stdio.h>

>  
>       2. int main()
>  
>       3. {
>  
>       4.      int n,i;
>  
>       5.      int a,b;
>  
>       6.      scanf("%d",&n);
>  
>       7.      for(i=0;i<n;i++)
>  
>       8.      {
>  
>       9.              scanf("%d%d",&a,&b);
>  
>       10.             printf("%d\n",a+b);
>  
>       11.     }
>  
>       12.     return 0;
>  
>       13. }
>  
>  
>  
>  
>     代码解读

 #include <stdio.h>

    
 #include <stdlib.h>
    
 #include <string.h>
    
 #include <stdbool.h>
    
 #include <math.h>
    
 #include <limits.h>
    
 #include <float.h>
    
 #include <regex.h>
    
 #include <ctype.h>
    
  
    
 #define CEILING_POS(X) ((X-(int)(X)) > 0 ? (int)(X+1) : (int)(X))
    
 #define CEILING_NEG(X) ((X-(int)(X)) < 0 ? (int)(X-1) : (int)(X))
    
 #define CEILING(X) ( ((X) > 0) ? CEILING_POS(X) : CEILING_NEG(X) )
    
  
    
 #define MIN(a, b) ((a) < (b)) ? (a) : (b)
    
 #define MAX(a, b) ((a) > (b)) ? (a) : (b)
    
  
    
 int cmpfunc (const void * a, const void * b) {
    
    return ( *(int*)a - *(int*)b );
    
 }
    
 //qsort(dp, m+1, sizeof(int), cmpfunc);
    
  
    
 int main() {
    
     //输入
    
     char input[200000];
    
     fgets(input, 200000, stdin);
    
  
    
     //逗号分隔
    
     char* token = strtok(input, ",");
    
     int heights[1000];
    
     int count1 = 0;
    
     while (token != NULL) {
    
     heights[count1++] = atoi(token);
    
     token = strtok(NULL, ",");
    
     }
    
  
    
     int left = 0;
    
     int right = count1 - 1;
    
     int result = 0;
    
  
    
     while (left < right) {
    
     int x = right - left;
    
     int y = heights[left] < heights[right] ? heights[left++] : heights[right--];
    
     result = MAX(result, x * y);
    
     }
    
  
    
  
    
     printf("%d",result);
    
     return 0;
    
 }
    
    
    
    
    代码解读