Advertisement
Guest User

Untitled

a guest
May 27th, 2015
195
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.91 KB | None | 0 0
  1. #include <stdio.h>
  2. int minimum(int a, int b) {
  3. if(a < b) return a;
  4. if(b < a) return b;
  5.  
  6.  
  7. }
  8.  
  9.  
  10.  
  11. int squarecount(int a[100][100],int row, int col) {
  12. int i,j,k,l,m,sum = 0,num = 0;
  13. for(i = 0; i < row; i++) {
  14.  
  15. for(j = 0; j < col; j++) {
  16.  
  17.  
  18.  
  19.  
  20. for(k = 0; k <= minimum(row - i,col - j); k++) {// k hoiche 2 tar modhe kom ta neyar jonno, i for row, j for col
  21. sum = 0;
  22. for(l = 0; l <= k; l++) {
  23.  
  24. for(m = 0; m <= k; m++) {
  25. sum = sum + a[i+l][j+m];
  26.  
  27. }
  28.  
  29. }
  30.  
  31.  
  32.  
  33. }
  34.  
  35. if(sum == (k + 1) * (k + 1) ) {
  36. if(num < sum) {
  37. num = sum;
  38. }
  39. }
  40.  
  41.  
  42. }
  43.  
  44. }
  45. printf("%d\n",sum);
  46.  
  47.  
  48.  
  49.  
  50.  
  51.  
  52.  
  53.  
  54. }
  55.  
  56.  
  57.  
  58.  
  59.  
  60. main()
  61. {
  62. int a[100][100],row,col,i,j;
  63. scanf("%d %d",&row,&col);
  64. for(i = 0; i < row; i++) {
  65. for(j = 0; j < col; j++) {
  66. scanf("%d",&a[i][j]);
  67. }
  68.  
  69. }
  70. squarecount(a,row,col);
  71. return 0;
  72. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement