fork(7) download
copy 
  1. #include <iostream>
  2. #include <algorithm>
  3. using namespace std;
  4.  
  5. int main() {
  6.     int N = 1000; //Print primes number from 1 to N
  7. 	vector<bool> primes(N, true);
  8.     long long  count = 0;
  9.     for(int i = 3; i*i < N; i += 2){
  10.     	for(int j = 3; j*i < N; j+=2){
  11.     		primes[j*i] = false;
  12.     		count++;
  13.     	}
  14.     }
  15.     if(N >= 2) cout << "2 ";
  16.     for(int i = 3; i < N; i+=2){
  17.     	count++;
  18.     	if(primes[i] == true) cout << i << " "; 
  19.     }
  20. 	cout << "\ncnt : " << count;
  21.  
  22.     return 0;
  23. }
Success #stdin #stdout 0s 3468KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
2 3 5 7 11 13 17 19 23 29 31 37 41 43 47 53 59 61 67 71 73 79 83 89 97 101 103 107 109 113 127 131 137 139 149 151 157 163 167 173 179 181 191 193 197 199 211 223 227 229 233 239 241 251 257 263 269 271 277 281 283 293 307 311 313 317 331 337 347 349 353 359 367 373 379 383 389 397 401 409 419 421 431 433 439 443 449 457 461 463 467 479 487 491 499 503 509 521 523 541 547 557 563 569 571 577 587 593 599 601 607 613 617 619 631 641 643 647 653 659 661 673 677 683 691 701 709 719 727 733 739 743 751 757 761 769 773 787 797 809 811 821 823 827 829 839 853 857 859 863 877 881 883 887 907 911 919 929 937 941 947 953 967 971 977 983 991 997 
cnt : 1167
https://ideone.com/9usUSs
language:
C++14 (gcc 8.3)
created:
8 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!