Cod sursa(job #2174004)
Utilizator | Data | 16 martie 2018 10:18:24 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, i, j, k;
bool c[2000010];
void ciur()
{
c[0]=c[1]=1;
for(i=2;i*i<=n;i++)
if(c[i]==0)
for(j=i;j*i<=n;j++)
c[i*j]=1;
for(i=0;i<=n;i++)
if(c[i]==0)
k++;
fout << k;
}
int main()
{
fin >> n;
ciur();
return 0;
}