Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- //Naogjame maximum na elementite nad glavnata dijagonala i mimum na elementite pod glavnata dijagonala.
- //Posle gi sporeduvash tie max i min i pogolemiot go stavash na sekoe mesto na glavnata dijagonala, pomaliot na sporednata
- #include<stdio.h>
- #define MAX 100
- int main(){
- int i,j,m,n,br=0;
- int max,min;
- int a[MAX][MAX];
- scanf("%d",&n);
- scanf("%d",&m);
- for(i=0;i<n;i++){
- for(j=0;j<m;j++){
- scanf("%d",&a[i][j]);
- }
- }
- int suma1=0;
- int suma2=0;
- for(i=0;i<n;i++){
- for(j=0;j<m;j++){
- if(i==j){
- if(i<j){
- suma1+=a[i][j];
- if(suma1>max){
- max=suma1;
- }
- }
- if(j<i){
- suma2+=a[i][j];
- if(suma2<min){
- min=suma2;
- }
- }
- }
- }
- }
- for(i=0;i<n;i++){
- for(j=0;j<m;j++){
- if(i==j){
- if(max>min){
- max=a[i][j];
- }
- if(min>max){
- min=a[i][j];
- }
- }
- if(i+j==n-1){
- if(min>max){
- max=a[i][j];
- }
- if(max>min){
- min=a[i][j];
- }
- }
- }
- }
- printf("%d",a[i][j]);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement