Cod sursa(job #1568450)
Utilizator | Data | 14 ianuarie 2016 11:43:57 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
char prim[2000005];
int main()
{
int n,c=0;
fin>>n;
for(int i=2;i<=n;++i)
prim[i]=1;
for(int i=2;i<=n;++i)
if(prim[i])
for(int j=i+i;j<=n;j+=i)
prim[j]=0;
for(int i=2;i<=n;++i)
if(prim[i])
++c;
fout<<c;
}