Cod sursa(job #1356017)
Utilizator | Data | 23 februarie 2015 09:26:55 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.33 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n;
bool ciur[2000001];
int main()
{
int i,nr=0,j;
fin>>n;
for(i=2;i<=n;i++)
ciur[i]=1;
for(i=2;i*i<=n;i++)
for(j=2;j*i<=n;j++)
ciur[i*j]=0;
for(i=2;i<=n;i++)
if(ciur[i]==1)
nr++;
fout<<nr;
return 0;
}