Advertisement
Guest User

Untitled

a guest
May 31st, 2016
55
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.79 KB | None | 0 0
  1. //Naogjame maximum na elementite nad glavnata dijagonala i mimum na elementite pod glavnata dijagonala.
  2. //Posle gi sporeduvash tie max i min i pogolemiot go stavash na sekoe mesto na glavnata dijagonala, pomaliot na sporednata
  3.  
  4. #include<stdio.h>
  5. #define MAX 100
  6. int main(){
  7. int i,j,m,n,br=0;
  8. int max,min;
  9. int a[MAX][MAX];
  10. scanf("%d",&n);
  11. scanf("%d",&m);
  12. for(i=0;i<n;i++){
  13. for(j=0;j<m;j++){
  14. scanf("%d",&a[i][j]);
  15. }
  16. }
  17. int suma1=0;
  18. int suma2=0;
  19. for(i=0;i<n;i++){
  20. for(j=0;j<m;j++){
  21. if(i==j){
  22. if(i<j){
  23. suma1+=a[i][j];
  24. if(suma1>max){
  25. max=suma1;
  26. }
  27. }
  28. if(j<i){
  29. suma2+=a[i][j];
  30. if(suma2<min){
  31. min=suma2;
  32. }
  33. }
  34. }
  35. }
  36. }
  37. for(i=0;i<n;i++){
  38. for(j=0;j<m;j++){
  39. if(i==j){
  40. if(max>min){
  41. max=a[i][j];
  42. }
  43.  
  44. if(min>max){
  45. min=a[i][j];
  46. }
  47. }
  48. if(i+j==n-1){
  49. if(min>max){
  50. max=a[i][j];
  51. }
  52. if(max>min){
  53. min=a[i][j];
  54. }
  55. }
  56. }
  57. }
  58. printf("%d",a[i][j]);
  59. return 0;
  60. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement