Cod sursa(job #1419097)
Utilizator | Data | 14 aprilie 2015 18:34:18 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int Nmax=2000000;
int *v;
int main(){
int n,i,nr=0;
in>>n;
v=new int[n+1];
for(i=2;i<=n;i++) v[i]=0;
for(i=2;i<=n;i++)
{
if(v[i]==0)
{
for(int j=i*2;j<=n;j=j+i)
{
v[j]=1;
}
nr++;
}
}
out<<nr<<'\n';
return 0;
}