Cod sursa(job #1777466)
Utilizator | Data | 12 octombrie 2016 15:32:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long v[2000000],b[100001],i,x,i1,j,ok,i2,med,c,nr,s,n;
short caz;
int main()
{
f>>n;
for(i=2;i<=n;i++)
v[i]=i;
for(i=2;i<=
sqrt(n);i++)
{
for(j=v[i]*v[i];j<=n;j=j+i)
v[j]=0;
}
nr=0;
for(i=1;i<=n;i++)
if(v[i]!=0)
nr++;
g<<nr;
return 0;
}