Cod sursa(job #1303946)
| Utilizator | Data | 28 decembrie 2014 15:39:48 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
const int NMAX=2000001;
int prim[NMAX],N,i,nr,nrprim;
void formare()
{
int ok=1;
for(int j=1;j<=nr;++j)
if(i%prim[j]==0)
{
ok=0;
return;
}
if(ok) prim[++nr]=i;
}
int main()
{
fin>>N;
prim[++nr]=2;
for(i=3;i<=N;++i)
formare();
fout<<nr;
return 0;
}
