Cod sursa(job #2156105)
Utilizator | Data | 8 martie 2018 14:41:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n;
int p[2000005];
void read()
{f>>n;
}
void ciur(int n)
{ int i,j;
for(i=2;i<=n;i++)
if(p[i]==0)
for(j=i+i;j<=n;j+=i)
p[j]=1;
}
int main()
{int i,nr=0;
read();
ciur(n);
for(i=2;i<=n;i++)
if(p[i]==0) nr++;
g<<nr;
f.close();
g.close();
return 0;
}