Cod sursa(job #1958580)
Utilizator | Data | 8 aprilie 2017 15:16:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.48 kb |
#include <fstream>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool v[2000001];
void ciur(){
int i,j,n;
v[1]=1;
for(i=2;i<=2000001;i++)
{
if(v[i]==0)
for(j=i*2;j<=2000001;j=j+i)
{
v[j]=1;
}
}
}
int main()
{
int n,i,r=0;
in>>n;
ciur();
for(i=1;i<=n;i++)
{
if(v[i]==0)
r++;
}
out<<r;
return 0;
}