Cod sursa(job #588089)
Utilizator | Data | 6 mai 2011 21:58:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <cstdio>
FILE *g,*z;
using namespace std;
int main()
{
z=fopen("ciur.out","w");
g=fopen("ciur.in","r");
int n,ct=0,v[2000001];
fscanf(g,"%d",&n);
fclose(g);
for(int i=2;i<=n;i++)
v[i]=1;
for(int i=2;i<=n;i++)
{
if(v[i])
{
ct++;
for(int j=i+i;j<=n;j+=i)
v[j]=0;
}
}
fprintf(z,"%d",ct);
fclose(z);
return 0;
}