Advertisement
Guest User

Untitled

a guest
Apr 21st, 2019
239
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.04 KB | None | 0 0
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define endl '\n'
  4. #define ll long long
  5. int main()
  6. {
  7. ios_base::sync_with_stdio(false);
  8. cin.tie(0);
  9. //freopen("input.test91","r",stdin);
  10. //freopen("output.test91","w",stdout);
  11. int a[3][3];
  12. for(int i=0;i<3;i++)
  13. {
  14. for(int j=0;j<3;j++)
  15. {
  16. cin >> a[i][j];
  17. }
  18. }
  19. int sum[8]={0};
  20. int v1[9],v2[9],m=0;
  21. if((a[0][0]!=0 && a[1][1]!=0 && a[2][2]!=0) || (a[1][1]!=0 && a[2][0]!=0 && a[0][2]!=0))
  22. {
  23. for(int i=0;i<3;i++)
  24. {
  25. sum[3]+=a[i][0];
  26. sum[4]+=a[i][1];
  27. sum[5]+=a[i][2];
  28. for(int j=0;j<3;j++)
  29. {
  30. if(i==0)
  31. {
  32. sum[0]+=a[i][j];
  33. }
  34. if(i==1)
  35. {
  36. sum[1]+=a[i][j];
  37. }
  38. if(i==2)
  39. {
  40. sum[2]+=a[i][j];
  41. }
  42. if(i==j)
  43. {
  44. sum[6]+=a[i][j];
  45. }
  46. if(i+j+1==3)
  47. {
  48. sum[7]+=a[i][j];
  49. }
  50. if(a[i][j]==0)
  51. {
  52. v1[m]=i;
  53. v2[m]=j;
  54. m++;
  55. }
  56. }
  57. }
  58. int max=sum[0];
  59. for(int i=0;i<8;i++)
  60. {
  61. if(sum[i]>sum[i+1])
  62. {
  63. max=sum[i];
  64. }
  65. }
  66. }
  67. return 0;
  68. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement