fork download
copy 
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int              long long int
  4. #define double           long double
  5. #define print(a)         for(auto x : a) cout << x << " "; cout << endl
  6.  
  7.  
  8. const int M = 1000000007;
  9. const int N = 3e5+9;
  10. const int INF = 2e9+1;
  11. const int LINF = 2000000000000000001;
  12.  
  13. inline int power(int a, int b, int mod=M) {
  14.     int x = 1;
  15.     a %= mod;
  16.     while (b) {
  17.         if (b & 1) x = (x * a) % mod; 
  18.         a = (a * a) % mod;
  19.         b >>= 1;
  20.     }
  21.     return x;
  22. }
  23.  
  24.  
  25. //_ ***************************** START Below *******************************
  26.  
  27.  
  28.  
  29.  
  30. vector<int> isPrime;
  31.  
  32.  
  33. //* Basic : No multiplication Overflow 
  34.  
  35. void seive1(){
  36.     isPrime.assign(N+1, 1);
  37.     isPrime[0] = isPrime[1] = 0;
  38.  
  39.     for(int i = 2; i<=N; i++){
  40.         if(isPrime[i] == 0) continue;
  41.  
  42.         for(int j=2*i; j<=N; j+=i){
  43.             isPrime[j] = 0;
  44.         }
  45.     }
  46. }
  47.  
  48.  
  49.  
  50. //* Optimization :    Seiving till root 
  51. //* 				i*i ==> may overflow
  52. void seive2(){
  53.  
  54. 	isPrime.assign(N+1, 1);
  55. 	isPrime[0] = isPrime[1] = 0;
  56.  
  57. 	for(int i = 2; i*i<=N; i++){
  58. 		if(isPrime[i] == 0) continue;
  59.  
  60. 		for(int j=i*i; j<=N; j+=i){
  61. 			isPrime[j] = 0;
  62. 		}
  63. 	}
  64.  
  65. }
  66.  
  67.  
  68.  
  69.  
  70. void consistency(int n){
  71.  
  72. 	for(int i=1; i<=n ; i++){
  73. 		if(isPrime[i] ) cout << i << ", ";
  74. 	}cout << endl;
  75. }
  76.  
  77.  
  78.  
  79.  
  80. void solve() {
  81.  
  82. 	static bool initialized = []() {
  83.         seive1(); 
  84.         return true;
  85.     }();
  86.  
  87. 	static int _ = (seive2(), 0);
  88.  
  89.  
  90.  
  91. 	int n;
  92. 	cin >> n;
  93.  
  94. 	consistency(n);
  95.  
  96. }
  97.  
  98.  
  99.  
  100.  
  101.  
  102. int32_t main() {
  103.     ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  104.  
  105.     int t = 1;
  106.     // cin >> t;
  107.     while (t--) {
  108.         solve();
  109.     }
  110.  
  111.     return 0;
  112. }
Success #stdin #stdout 0.01s 5552KB
comments (?)
stdin
copy 
20
stdout
copy 
2, 3, 5, 7, 11, 13, 17, 19,
https://ideone.com/vlog4k
language:
C++14 (gcc 8.3)
created:
1 hour 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!