Cod sursa(job #1419098)
Utilizator | Data | 14 aprilie 2015 18:35:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 60 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include<fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
const int Nmax=2000000;
short int v[Nmax+1];
int main(){
int n,i,nr=0;
in>>n;
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;
}