Cod sursa(job #1007706)
Utilizator | Data | 9 octombrie 2013 17:00:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.3 kb |
#include<cstdio>
#include<cstring>
using namespace std;
FILE *f,*g;
int n,v[2000001],k=0;
int main()
{
f=fopen("ciur.in","r");
g=fopen("ciur.out","w");
fscanf(f,"%d",&n);
for(int i=2;i<=n;++i)
if(!v[i])
{
++k;
for(int j=i+i;j<=n;j+=i) v[j]=1;
}
fprintf(g,"%d\n",k);
return 0;
}