Pagini recente » Cod sursa (job #299301) | Cod sursa (job #3229612) | Cod sursa (job #1531734) | Cod sursa (job #2952184) | Cod sursa (job #145832)
Cod sursa(job #145832)
#include <cstdio>
char A[2000000];
int main()
{
freopen("ciur.in", "r", stdin);
freopen("ciur.out", "w", stdout);
int n;
scanf("%d", &n);
int i, f;
int p = 2;
for(i=2; i<=n; i++)
A[i] = 1;
for(p = 2; p < n/2; p++)
{
if(A[p])
{
f = 1;
for(i = 2; f < n; i++)
{
f = i*p;
A[f] = 0;
}
}
}
/*
for(i = 0; i <= n; i++)
{
if(A[i])
{
printf("%d ", i);
}
}
*/
f = 1000;
int lasti = 0;
int cnt = 0;
A[1] = 0;
for(i = n; i > 0 && f; i--)
{
if(A[i])
{
f--;
lasti = i;
cnt++;
}
}
printf("%d\n", cnt);
for(i = lasti; i <= n; i++)
{
if(A[i])
{
printf("%d ", i);
}
}
return 0;
}