Cod sursa(job #1675863)
Utilizator | Data | 5 aprilie 2016 16:51:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#define nMax 2000001
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n;
bool viz[nMax];
void ciur()
{
int Sol=1;
for(int i=3;i<=n;i+=2)
{
if(viz[i]==0)
{
Sol++;
for(int j=i+i+i;j<=n;j+=(i << 1))
viz[j]=1;
}
}
fout<<Sol;
}
int main()
{
fin>>n;
ciur();
return 0;
}