Cod sursa(job #1928251)
Utilizator | Data | 15 martie 2017 23:28:23 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.46 kb |
#include <bits/stdc++.h>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,nr=0;
f>>n;
vector<int> prim(n+1,0);
for (int i=2;i<=n;++i)
{
prim[i]=i;
}
for (int i=2;i<=n;++i)
{
if (prim[i])
{
nr++;
for (int j=i+i;j<=n;j+=i)
{
prim[j]=0;
}
}
}
g<<nr;
return 0;
}