Cod sursa(job #1049231)
Utilizator | Data | 7 decembrie 2013 08:43:08 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int ciur[2000000],i,j,nr,N;
int main()
{
fin>>N;
ciur[0]=1;ciur[1]=1;i=2;
for(i=2;i*i<=N;i++)
{
if(!ciur[i]) for(j=i;j*i<=N;j++) ciur[j*i]=1;
}
for(i=2;i<N;i++) if(!ciur[i]) nr++;
fout<<nr;
}