numberFull.cpp

#include<bits/stdc++.h>
#define MAX 5000042
using namespace std;
int divs[MAX];

void slowSieve(int n)
{
    for( int i = 0; i <= n; i++ )
        divs[i] = 0;

    for( int i = 2; i <= n; i++ )
        if( divs[i] == 0 )
            for( int p = i; p <= n; p *=i )
                for( int m = p; m <= n; m += p )
                    divs[m]++;
}

int main()
{
    int m;
    scanf("%d", &m);
    slowSieve(m);

    for( int i = 0; i <= m; i++ )
        if( divs[i] == 1 )
            printf("%d ", i);
    printf("\n");
}