Cod sursa(job #1595328)
| Utilizator | Data | 10 februarie 2016 10:45:21 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 40 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.54 kb |
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
long long prime[2000001],np,i,j,N;
char v[1000009];
int main()
{
fin>>N;
for(i=1;i<=N;i++)
{
v[i]=0;
}
np=0;
for(i=2;i<=N;i++)
{
if(v[i]==0)
{
prime[np+1]=i;
np=np+1;
v[i]=2;
for(j=i*i;j<=N;j=j+i)
{
v[j]=1;
}
}
}
fout<<np;
fin.close();
fout.close();
return 0;
}
