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