Cod sursa(job #1393541)
Utilizator | Data | 19 martie 2015 15:59:46 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
FILE *f=fopen("ciur.in","r");
FILE *g=fopen("ciur.out","w");
int n,i,nr,j;
char c[2000005];
int main()
{
fscanf(f,"%d",&n);
for (i=2;i<=n;i++)
c[i]=1;
for (i=2;i<=n;i++)
if (c[i]==1)
{
nr++;
for (j=i*i;j<=n;j+=i)
c[j]=0;
}
fprintf(g,"%d",nr);
return 0;
}