Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- int prim(int x)
- {
- int nr=0;
- for(int i=1;i<=x;i++)
- {
- if(x%i==0)
- nr++;
- }
- if(nr==2)
- return 1;
- else
- return 0;
- }
- void numereprime(int v[21],int n)
- {
- int p=0;
- for(int i=2;i<=n;i++)
- {
- if(prim(i)==1)
- {
- v[p]=i;
- p++;
- }
- }
- for(int i=1;i<p;i++)
- cout<<v[i]<<" ";
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement