Cod sursa(job #2504056)
Utilizator | Data | 4 decembrie 2019 12:07:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool c[2000001];
int main()
{
int n,nr=0,vm=30000000;
fin>>n;
for(int i=2; i*i<vm;i++)
{
if(!c[i])
{
for(int j= i*i; j <vm; j+=i)
{
c[j]=true;
}
}
}
for (int i=1 ;i <=n;i++)
{
if(!c[i])
nr++;
}
fout<<nr;
}