Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <math.h>
- using namespace std;
- bool prim(int nr)
- {
- for(int i = 2; i <= sqrt(nr) ; i++)
- if(nr%i == 0)
- return false;
- return true;
- }
- int nleaprim(int n)
- {
- int nr=2;
- int contor = 0;
- while(true)
- {
- if(prim(nr))
- {
- cout<< nr << " ";
- contor++;
- }
- if(contor == n)
- return nr;
- nr++;
- }
- }
- int main()
- {
- int n;
- cin>>n;
- cout<<"al n-lea nr prim este:"<<nleaprim(n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement