Cod sursa(job #2487661)
Utilizator | Data | 5 noiembrie 2019 17:11:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
int main()
{
bool v[200001];
int n,i,k=0;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for(i=2;i<=n;i++)
v[i]=1;
for(i=2;i*i<=n;i++)
if(v[i]!=0)
for(int j=i;j<=n/i;j++)
v[i*j]=0;
for(i=2;i<=n;i++)
if(v[i]!=0)
k++;
g<<k;
return 0;
}