Cod sursa(job #1239104)
Utilizator | Data | 8 octombrie 2014 11:19:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<stdio.h>
bool c[10000];
using namespace std;
int main()
{
FILE *in,*out;
in=fopen("ciur.in","r");
out=fopen("ciur.out","w");
int i,j,n;
scanf("%d",&n);
for(i=2; i*i<=n; i++)
{
if(!c[i])
for(j=i*i; j<=n; j+=i)
c[j]=true;
}
for(i=2; i<=n; i++)
{
if(!c[i])
printf("%d ",i);
}
return 0;
}