Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <stdio.h>
- #define f1(a,b,c) for(a=b;a<=c;a++)
- #define f(a,b,c) for(a=b;a<c;a++)
- int isUpper(int ar[][10],int n);
- int isLower(int ar[][10],int n);
- int main(void) {
- int i,j,n;
- scanf("%d",&n);
- int ar[n][n];
- f(i,0,n)
- f(j,0,n)
- scanf("%d",&ar[i][j]);
- if(isUpper(ar,n))
- printf("Upper");
- else printf("Not upper");
- if(isLower(ar,n))
- printf("Lower");
- else printf("Not Lower");
- }
- int isUpper(int ar[][10],int n)
- {
- int i,j,flag1=1;
- f(i,0,n)
- { f(j,0,n)
- { if(i+j<n && ar[i][j]==0)
- flag1=0;
- }
- }
- if(flag1==0)
- return 0;
- if(flag1==1)
- { f(i,0,n)
- { f(j,0,n)
- if(i+j>=n && ar[i][j]!=0)
- flag1=0;
- }
- }
- if(flag1==1)
- return 1;
- if(flag1==0)
- return 0;
- }
- int isLower(int ar[][10],int n)
- { int i,j,flag2=1;
- f(i,0,n)
- { f(j,0,n)
- { if(i+j>=n && ar[i][j]==0)
- flag2=0;
- }
- }
- if(flag2==0)
- return 0;
- if(flag2==1)
- { f(i,0,n)
- { f(j,0,n)
- if(i+j<n && ar[i][j]!=0)
- flag2=0;
- }
- }
- if(flag2==0)
- return 0;
- else return 1;
- }
Add Comment
Please, Sign In to add comment