Cod sursa(job #2504744)
Utilizator | Data | 5 decembrie 2019 15:21:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 70 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool v[200000001];
int main()
{
int n,i,j,gigel=0;
in>>n;
v[1]=1;
v[2]=0;
for(i=2;i*i<=n;i++)
for(j=i;j*i<=n;j++)
{
v[i*j]=1;
}
for(i=1;i<=n;i++)
{
if(v[i]==0)
gigel++;
}
out<<gigel;
return 0;
}