Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- int minimum(int a, int b) {
- if(a < b) return a;
- if(b < a) return b;
- }
- int squarecount(int a[100][100],int row, int col) {
- int i,j,k,l,m,sum = 0,num = 0;
- for(i = 0; i < row; i++) {
- for(j = 0; j < col; j++) {
- 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
- sum = 0;
- for(l = 0; l <= k; l++) {
- for(m = 0; m <= k; m++) {
- sum = sum + a[i+l][j+m];
- }
- }
- }
- if(sum == (k + 1) * (k + 1) ) {
- if(num < sum) {
- num = sum;
- }
- }
- }
- }
- printf("%d\n",sum);
- }
- main()
- {
- int a[100][100],row,col,i,j;
- scanf("%d %d",&row,&col);
- for(i = 0; i < row; i++) {
- for(j = 0; j < col; j++) {
- scanf("%d",&a[i][j]);
- }
- }
- squarecount(a,row,col);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement