Cod sursa(job #951749)
Utilizator | Data | 21 mai 2013 16:29:11 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
#define NMax 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,Nr;char Prim[NMax];
int main()
{
int i,j;
fin>>N;
for(i=2;i<=N;i++)
Prim[i]=1;
for(i=2;i<=N;i++)
{
if(Prim[i])
{
Nr++;
for(j=i+i;j<=N;j=j+i)
{
Prim[j]=0;
}
}
}
fout<<Nr<<"\n";
return 0;
}