Advertisement
TwiNNeR

10 vezhbi c

Dec 26th, 2014
205
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 0.59 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <math.h>
  3.  
  4. int main() {
  5.     int n,m,i,j,a[100][100],zbir,k=0,ii,jj;
  6.     scanf("%d%d",&n,&m);
  7.     for(i=0; i<n; i++)
  8.         for(j=0; j<m; j++)
  9.             scanf("%d",&a[i][j]);
  10.     int maxi=0;
  11.     for(i=0; i<n-1; i++,k++) {
  12.         for(j=0; j<m-1; j++) {
  13.             zbir=a[i][j]+a[i][j+1]+a[i+1][j]+a[i+1][j+1];
  14.             if(zbir>maxi) {
  15.                 ii=i;
  16.                 jj=j;
  17.                 maxi=zbir;
  18.             }
  19.             zbir=0;
  20.         }
  21.     }
  22.     printf("%d %d \n%d %d ",a[ii][jj],a[ii][jj+1],a[ii+1][jj],a[ii+1][jj+1]);
  23.     return 0;
  24. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement