Cod sursa(job #1552119)
| Utilizator | Data | 17 decembrie 2015 11:44:06 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.41 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int N,j,prim,d,nr,i;
bool v[2000000];
int main()
{
fin>>N;
for(i=2;i<=N;i++)
{
if(v[i]==0)
{
nr++;
j=i;
while(j+i<=N)
{
j=j+i;
v[j]=1;
}
}
}
fout<<nr;
return 0;
}
