Advertisement
LegoDrifter

Untitled

Dec 16th, 2020
279
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.95 KB | None | 0 0
  1. #include <stdio.h>
  2. #include <stdlib.h>
  3.  
  4. int main()
  5. {
  6. int m[100][100];
  7. int n,k1=0,k2=0,glav=0,spored=0;
  8. scanf("%d",&n);
  9. for(int i=0;i<n;i++)
  10. {
  11. for(int j=0;j<n;j++)
  12. {
  13. scanf("%d",&m[i][j]);
  14. }
  15. }
  16. for(int i=0;i<n;i++)
  17. {
  18. for(int j=0;j<n;j++)
  19. {
  20. if(i==j)
  21. {
  22. glav+=m[i][j];
  23. }
  24. if(i+j==n-1)
  25. {
  26. spored+=m[i][j];
  27. }
  28. //printf("%d ",m[i][j]);
  29. }
  30. }
  31. for(int j=0;j<n;j++)
  32. {
  33. for(int i=0;i<n;i++)
  34. {
  35. if(j==0)
  36. {
  37. k1+=m[i][j];
  38. }
  39. if(j==n-1)
  40. {
  41. k2+=m[i][j];
  42. }
  43. //printf("%d ",m[i][j]);
  44. }
  45. //printf("\n");
  46. }
  47. printf("%d\n",glav-spored);
  48. printf("%d\n",k1-k2);
  49. return 0;
  50. }
  51.  
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement