Cod sursa(job #2162951)
Utilizator | Data | 12 martie 2018 16:04:59 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,d,k,n;
bool c[2000001];
int main()
{
f>>n;
for(i=2;i<=n;i=i+2) c[i]=1;
for(i=3;i<=n;i=i+2)
if(c[i]==0)
for(d=3*i;d<=n;d=d+2*i) c[d]=1;
for(i=1;i<=n;++i)
if(c[i]==0) k++;
g<<k;
}