Pagini recente » Cod sursa (job #134507) | Rating velcu andrei (andr3wDha) | Cod sursa (job #1218974) | Cod sursa (job #1442332) | Cod sursa (job #144773)
Cod sursa(job #144773)
#include <stdio.h>
#include <vector>
#define NMax 10005
long n, lg;
char ciur[NMax];
std::vector<long> prime;
int main()
{
long i, j, nr;
freopen( "ciur.in", "rt", stdin );
freopen( "ciur.out", "wt", stdout );
scanf( "%ld", &n );
if ( n >= 10000 )
n = 10000;
for (i=2; i<=n; i++)
{
if ( !ciur[i] )
{
for (j=i; j<=n; j+=i)
if ( j % i == 0 )
ciur[j] = 1;
prime.push_back(i);
}
}
lg = prime.size();
printf( "%ld\n", lg );
for (i=0; i<lg; i++)
printf( "%ld ", prime[i] );
printf( "\n" );
return 0;
}