Advertisement
Guest User

Untitled

a guest
Nov 24th, 2014
160
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.50 KB | None | 0 0
  1. #include <iostream>
  2. #include <fstream>
  3. using namespace std;
  4.  
  5. int prim(int x)
  6. {
  7. int k;
  8. k=1;
  9. for(int i=2;i<x/2;i++)
  10. if(x%i==0) k=0;
  11.  
  12. return k;
  13. }
  14.  
  15.  
  16. int main()
  17. {
  18. int
  19. ifstream f("mat.in")
  20. f>>n;
  21. for(int i=1;i<=n;i++)
  22. for(int j=1;j<=n;j++)
  23. f>>a[i][j];
  24. for(int i=1;i<=n;i++)
  25. for(int j=1;j<=n;j++)
  26. if(i<j)
  27. if(prim(a[i][j]%2==0))
  28. y=y+a[i][j];
  29. cout<<y;
  30.  
  31. return 0;
  32. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement