Cod sursa(job #1015273)
| Utilizator | Data | 24 octombrie 2013 10:40:05 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.46 kb |
#include<fstream>
#include<vector>
using namespace std;
fstream f("ciur.in");
ofstream g("ciur.out");
int n;
int getPrimes()
{
std::vector<bool> vec(n+1);
std::fill(vec.begin(), vec.end(), true );
int result = 0;
for(int i=2;i<=n;i++)
{
if(vec[i])
{
result++;
for(int j=2*i;j<=n;j+=i)
{
vec[j]=false;
}
}
}
return result;
}
int main()
{
f>>n;
g<<getPrimes()<<endl;
f.close();
g.close();
return 0;
}