Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <bits/stdc++.h>
- using namespace std;
- void sangnguyento(int n)
- {
- bool prime[n+1];
- for (int i=2;i<=n;i++)
- prime[i]=true;
- for (int i=2;i*i<=n;i++)
- if (prime[i]==true)
- for (int j=i*i;j<=n;j+=i)
- prime[j]=false;
- for (int i=2;i<=n;i++)
- if (prime[i]==true)
- cout<<i<<" ";
- }
- int main()
- {
- int n;
- cin>>n;
- sangnguyento(n);
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement