Cod sursa(job #1418196)
Utilizator | Data | 12 aprilie 2015 12:25:20 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
#define NMAX 2000005
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool c[NMAX];
int i ,n , nr;
void ciur()
{
int i , j;
c[1]=c[0]=1;
for(i=2;i*i<=NMAX;i++)
{
if(c[i]==0)
{
for(j=i*i;j<=NMAX;j+=i)
{
c[j]=1;
}
}
}
}
int main()
{
ciur();
f>>n;
for(i=1;i<=n;i++)
{
if(c[i]==0)
{
++nr;
}
}
g<<nr;
return 0;
}