Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <iomanip>
- using namespace std;
- int prim(long long x)
- {
- long long i;
- if(x==1 || x==0)
- return 0;
- for(i=2;i*i<x;i++)
- if(x%i==0)
- return 0;
- if(i*i==x)
- return 0;
- return 1;
- }
- int main()
- {
- unsigned long long i,j,n,ok=0,x,s=0;
- cin>>n;
- for(i=1;i<=n;i++)
- {
- cin>>x;
- ok=0;
- if(prim(x)==1)
- s+=x;
- else
- {
- for(j=1;j*j<=x && ok==0;j++)
- if(x%j==0 && prim(j)==1)
- {
- ok=1;
- s+=j;
- }
- }
- }
- cout<<s;
- return 0;
- }
Add Comment
Please, Sign In to add comment