Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <fstream>
- using namespace std;
- int prim(int x)
- {
- int k;
- k=1;
- for(int i=2;i<x/2;i++)
- if(x%i==0) k=0;
- return k;
- }
- int main()
- {
- int
- ifstream f("mat.in")
- f>>n;
- for(int i=1;i<=n;i++)
- for(int j=1;j<=n;j++)
- f>>a[i][j];
- for(int i=1;i<=n;i++)
- for(int j=1;j<=n;j++)
- if(i<j)
- if(prim(a[i][j]%2==0))
- y=y+a[i][j];
- cout<<y;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement