Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include<iostream>
- using namespace std;
- int prim(int n)
- {
- int d=2;
- if(n<2) return 0;
- for(d=2;d<=n/2;d++)
- {
- if(n%d==0)
- return 0;
- }
- return 1;
- }
- int main()
- {
- int x,y,k,cate=0,i;
- cin>>x>>y>>k;
- for(i=x; i<=y; i++)
- {
- if(prim(i)==1 && cate<=k)
- {
- cout<<i<<" ";
- cate++;
- }
- }
- if(cate!=0)
- cout<<endl<<"s-au gasit mai putine nr prime:"<<cate<<" ";
- }
Add Comment
Please, Sign In to add comment