Cod sursa(job #1156127)
Utilizator | Data | 27 martie 2014 14:08:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <vector>
#include <math.h>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,contor;
bool k[2000005];
int main()
{
fin>>n;
contor = 1;
for(int i=3;i<=sqrt(n);i+=2)
{
if(!k[i])
{
for(int j=i*i;j<=n;j+=i)k[i]=true;
}
}
for(int i=3;i<=n;i+=2)
{
if(!k[i])contor++;
}
fout<<contor;
return 0;
}