Cod sursa(job #2100534)
Utilizator | Data | 5 ianuarie 2018 20:02:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
long N, nr=0;
f>>N;
bool V[N+1];
fill(V,V+N+1,0);
V[0]=V[1]=1;
for(int i=2;i<=N;i++)
{
if(!V[i])
{
nr++;
for(int d=i+i;d<=N;d+=i) V[d]=1;
}
}
g<<nr;
return 0;
}