Cod sursa(job #589966)
Utilizator | Data | 14 mai 2011 20:13:17 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <cstdio>
FILE *g,*z;
using namespace std;
int main()
{
g=fopen("ciur.in","r");
z=fopen("ciur.out","w");
int n,i,j,ct=0;
bool v[2000000];
fscanf(g,"%d",&n);
for(i=2;i<=n;i++)
v[i]=true;
for(i=2;i<=n;i++)
{
if(v[i]==true)
{
ct++;
for(j=i+i;j<=n;j+=i)
v[j]=false;
}
}
fprintf(z,"%d",ct);
return 0;
}