Cod sursa(job #1361242)
Utilizator | Data | 25 februarie 2015 20:20:05 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.49 kb |
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,l,i,m,nr=1;
char v[2000000];
int main()
{
f>>n;
l=n/2;
for(i=2;i<=l;++i)
if(v[i]==0)
{
m=2*i;
while(m<n)
{
v[m]=1;
m=m+i;
}
}
for(i=3;i<=n;i=i+2)
if(v[i]==0) nr++;
g<<nr;
g<<'\n';
f.close();g.close();
return 0;
}