Cod sursa(job #797495)
Utilizator | Data | 14 octombrie 2012 10:51:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include<cstdio>
using namespace std;
int n,c,i,j;
char p[2000010];
int main ()
{
FILE *r = fopen("ciur.in", "r");
FILE *w = fopen("ciur.out", "w");
fscanf(r, "%d", &n);
for(i=2;i*i<=n;i++)
if(p[i]==0)
{
c++;
for(j=i*i;j<=n;j+=i)p[j]=1;
}
for(;i<=n;i++)
if(p[i]==0)c++;
fprintf(w, "%d",c);
return 0;
}