Cod sursa(job #961722)
| Utilizator | Data | 12 iunie 2013 19:22:41 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#define NMax 2000005
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,Nr;
bool 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]==1)
{
Nr++;
for(j=i+i;j<=N;j=j+i)
{
prim[j]=0;
}
}
}
fout<<Nr<<'\n';
return 0;
}
