Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- vector<int> new_prime(int n) {
- vector<int> prime;
- for(int i = 2; i <= n; ++i) {
- prime.push_back(i);
- }
- vector<int> new_prime;
- for(int i = 0; i < prime.size(); ++i) {
- bool isPrime = true;
- for (int j = 0; j < new_prime.size(); ++j) {
- if (prime[i] % new_prime[j] == 0) {
- isPrime = false;
- break;
- }
- }
- if (isPrime) {
- new_prime.push_back(prime[i]);
- }
- }
- return new_prime;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement