Cod sursa(job #1268598)
Utilizator | Data | 21 noiembrie 2014 08:33:39 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <iostream>
#include <fstream>
using namespace std;
#define MAX 2000100
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool a[MAX];
int n,k;
void ciur()
{
for(int i=2;i*i<=n;i++)
{
if(a[i]==0)
{
for(int j=i*i;j<=n;j+=i)
a[j]=1;
}
}
}
int main()
{
fin>>n;
ciur();
for(int i=2;i<=n;i++)
if(!a[i])
k++;
fout<<k;
return 0;
}