4 条题解

  • 0
    @ 2025-3-30 20:17:46
    #include<stdio.h>
    int main()
    {
        int m,n,sum=0;
        scanf("%d %d",&m,&n);
        int arr[m][n];
        for(int i=0;i<m;i++)
        {
            for(int j=0;j<n;j++)
            {
                scanf("%d",&arr[i][j]);
                if(i==0||i==m-1||j==0||j==n-1)
                {
                    sum+=arr[i][j];
                }
            }
        }
        printf("%d",sum);
        return 0;
    }
    ```
    
    
    ```
    • 0
      @ 2025-2-16 22:45:45
      m, n = map(int, input().split())
      a = []
      sum = 0
      for i in range(m):
          row = list(map(int, input().split()))
          a.append(row)
      for i in range(m):
          for k in range(n):
              if i == 0 or i == m - 1 or k == 0 or k == n - 1:
                  sum += a[i][k]
      print(sum)
      • 0
        @ 2024-9-22 22:32:52
        #include <stdio.h>
        
        int main()
        {
            int j, k, count = 0;
            scanf("%d%d\n", &j, &k);
            int a[j][k];
            for (int i = 0; i < j; i++)
            {
                for (int p = 0; p < k; p++)
                {
                    scanf("%d", &a[i][p]);
                    if (i == 0 || i == j - 1 || p == 0 || p == k - 1)
                    {
                        count += a[i][p];
                    }
                    
                }
            }
            printf("%d", count);
        
            return 0;
        }
        
        
        • 0
          @ 2024-9-22 10:52:13
          #include <stdio.h>
          int main()
          {
          	int n,m=0;
          	scanf("%d %d",&n,&m);
              int a[n][m];
              int i=0;
              int sum=0;
              int num=0;
          
              for (i=0;i<n;i++){
                  for (num=0;num<m;num++){
                      scanf("%d",&a[i][num]);
                      if (i==0||i==n-1||num==0||num==m-1)
                          sum+=a[i][num];
                  }
              }
              printf("%d",sum);
              return 0;
          }
          
          • 1

          信息

          ID
          130
          时间
          1000ms
          内存
          256MiB
          难度
          8
          标签
          递交数
          16
          已通过
          6
          上传者