Cod sursa(job #2297211)
Utilizator | Data | 5 decembrie 2018 16:07:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
bool v[2000000];
ifstream in("ciur.in");
ofstream out("ciur.out");
int main()
{
int i,d,n,c=0;
in>>n;
for(i=2;i<=n;++i)
{
v[i]=1;
}
for(i=2;i<=n;++i)
{
if(v[i])
{ ++c;
for(d=2*i;d<=n;d+=i)
v[d]=0;
}
}
out<<c;
return 0;
}