Cod sursa(job #649763)
Utilizator | Data | 16 decembrie 2011 17:55:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<stdio.h>
#define Nmax 200000
int main()
{
int n,k=0,i,j;
char a[Nmax];
fscanf("%d",&n);
for (i=2;i<=n;i++)
a[i]=1;
for (i=2;i<=n;i++)
if (a[i]==1)
{
k++;
for (j=2*i;j<=n;j=j+i)
a[j]=0;
}
fprintf("Sunt %d numere prime mai mici sau egale ca %d",k,n);
system("pause");
return 0;
}