Advertisement
Guest User

irfo

a guest
Nov 26th, 2014
168
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.80 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. int main()
  5. {
  6. int n,i,j,k,z;
  7. float a[30][30]={0};
  8.  
  9. float b,c,d,f,q1,q2,q3,q4;
  10. printf("Unesite broj n: ");
  11. scanf("%d",&n);
  12.  
  13. if (n>30 || n<3 )
  14. {
  15. printf("Unos pogresan!");
  16. return 0;
  17.  
  18. }
  19. b=n/2;
  20. if (n%2!=0)
  21. k=n/2;
  22. else k=n/2-1;
  23.  
  24.  
  25.  
  26. for (i=1;i<=n;i++)
  27. {printf ("Unesite elemente %d reda: ",i);
  28. for (j=1;j<=n;j++)
  29. {
  30.  
  31. scanf ("%f",&a[i][j]);
  32.  
  33.  
  34. }
  35.  
  36. }
  37.  
  38. z=1;
  39. for (i=1;i<=k;i++)
  40. {
  41. for (j=1+z;j<=n-z;j++)
  42. {
  43.  
  44. if(a[i][j]>q1)
  45. q1=a[i][j];
  46.  
  47.  
  48.  
  49.  
  50. }
  51. z++;
  52.  
  53. }
  54.  
  55. z=1;
  56. q2=1000;
  57. for (i=1;i<=k;i++)
  58. {
  59. for (j=1+z;j<=n-z;j++)
  60. {
  61.  
  62.  
  63. if(a[j][i]<q2)
  64. q2=a[j][i];
  65.  
  66.  
  67.  
  68.  
  69. }
  70. z++;
  71.  
  72. }
  73. z=1;
  74. q3=1000;
  75. for (i=n;i>=k;i--)
  76. {
  77. for (j=1+z;j<=n-z;j++)
  78. {
  79.  
  80.  
  81. if(a[j][i]<q3)
  82. q3=a[j][i];
  83.  
  84.  
  85.  
  86.  
  87. }
  88. z++;
  89.  
  90. }
  91.  
  92.  
  93. z=1;
  94. q4=0;
  95. for (i=n;i>=k;i--)
  96. {
  97. for (j=1+z;j<=n-z;j++)
  98. {
  99.  
  100. if(a[i][j]>q4)
  101. q4=a[i][j];
  102.  
  103.  
  104.  
  105.  
  106. }
  107. z++;
  108.  
  109. }
  110.  
  111.  
  112.  
  113. if (q1==q4&&q2==q3)
  114. {
  115. printf("Matrica je simetricna!\n");
  116. printf("Elementi: O1 = %.3f, O2 = %.3f, O3 = %.3f, O4 = %.3f",q1,q2,q3,q4);
  117. }else
  118. {
  119. printf("Matrica nije simetricna!\n");
  120. printf("Elementi: O1 = %.3f, O2 = %.3f, O3 = %.3f, O4 = %.3f",q1,q2,q3,q4);
  121.  
  122. }
  123.  
  124. return 0;
  125. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement