Cod sursa(job #1324604)
Utilizator | Data | 22 ianuarie 2015 16:11:34 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | c | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <stdio.h>
#include <stdlib.h>
char c[2000001];
int main()
{
FILE *in , *out;
in=fopen("ciur.in" , "r");
out=fopen("ciur.out" , "w");
int i , j , n , nr;
fscanf(in , "%d" , &n);
nr=0;
for(i=2;i*i<=n;i++)
{
if(!c[i])
for(j=i*i;j<=n;j+=i)
c[j]=1;
}
for(i=2;i<=n;i++)
{
if(c[i]==0)
nr=nr+1;
}
fprintf(out , "%d" , nr);
return 0;
}