Cod sursa(job #2634876)
Utilizator | Data | 12 iulie 2020 16:00:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
int stieve(int x)
{
vector<bool> v;
v.resize(x+1,1);
int nr=0;
for(int i=2; i<=x; i++)
if(v[i]==1)
{
nr++;
for(int j=2*i; j<=x; j+=i)
v[j]=0;
}
return nr;
}
int main()
{
fstream f("ciur.in");
ofstream g("ciur.out");
int n;
f>>n;
g<<stieve(n);
f.close();
g.close();
return 0;
}