Advertisement
Guest User

Untitled

a guest
Sep 30th, 2014
188
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.59 KB | None | 0 0
  1. Vector<int> list;
  2. list += 2;
  3. list += 3;
  4. for (int i = 1; (i*6 + 1) < 1000; i++) { //create a list of numbers from which to remove non primes from
  5. list += i*6 - 1;
  6. list += i*6 + 1;
  7. }
  8. for (int j = 0; j < list.size(); j++) {
  9. //primes += list[j];
  10. for (int k = (j + 1); k < list.size(); k++) {
  11. if (list[k] % list[j] == 0) {
  12. //cout << "removed " << list[k] << " and divided by " << list[j] << endl;
  13. list.remove(k);
  14. //k--;
  15. //j--;
  16. }
  17. }
  18. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement