fork download
copy 
  1. #include<bits/stdc++.h>
  2. using namespace std;
  3. #define endl '\n'
  4. #define int long long
  5. const int MOD = pow(10,9)+7;
  6. const int MOD2 = 998244353;
  7. const int INF = LLONG_MAX/2;
  8.  
  9. int primes[1000000];
  10.  
  11. void seive(){
  12.     fill(primes, primes + 1000000, 1);
  13.     primes[0] = primes[1] = 0;
  14.     for(int i = 2 ; i*i < 1000000 ; i++){
  15.         if(primes[i]){
  16.             for(int j = i*i ; j < 1000000 ; j += i){
  17.                 primes[j] = 0;
  18.             }
  19.         }
  20.     }
  21. }
  22. int spf[1000001];
  23. void SPF(){
  24.    for(int i = 2 ; i<=1000000 ; i++){
  25.        spf[i] = i;
  26.    }
  27.    for(int i = 2 ; i<=sqrt(1000000) ; i++){
  28.         if(spf[i]==i){
  29.             for(int j = i*i ; j<=1000000 ; j+=i){
  30.                 if(spf[j]==j){
  31.                 spf[j] = i;
  32.                 }
  33.             }
  34.         }
  35.    }
  36. }
  37. void solve() {
  38.     SPF();
  39.     for(int i = 1 ; i<=100 ; i++){
  40.         cout<<spf[i]<<" ";
  41.     }
  42.     cout<<endl;
  43. }
  44.  
  45. signed main(){
  46.     ios::sync_with_stdio(false); cin.tie(NULL);
  47.     //int t;
  48.     //cin >> t;
  49.     //while(t--){
  50.         solve();
  51.     //}
  52.     return 0;
  53. }
Success #stdin #stdout 0.02s 11792KB
comments (?)
stdin
copy 
Standard input is empty
stdout
copy 
0 2 3 2 5 2 7 2 3 2 11 2 13 2 3 2 17 2 19 2 3 2 23 2 5 2 3 2 29 2 31 2 3 2 5 2 37 2 3 2 41 2 43 2 3 2 47 2 7 2 3 2 53 2 5 2 3 2 59 2 61 2 3 2 5 2 67 2 3 2 71 2 73 2 3 2 7 2 79 2 3 2 83 2 5 2 3 2 89 2 7 2 3 2 5 2 97 2 3 2
https://ideone.com/dMAF85
language:
C++14 (gcc 8.3)
created:
7 hours 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!