Cod sursa(job #2532015)
Utilizator | Data | 27 ianuarie 2020 09:43:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000001];
int main()
{
int i,n,j,c=0;
fin>>n;
for(i=2;i*i<=n; i++)
{
if(v[i]==1)
continue;
for (j=2*i; j<=n; j+=i)
v[j]=1;
}
for(i=2; i<=n; i++)
if(v[i]==0)
c++;
fout<<c;
return 0;
}