Cod sursa(job #928045)
Utilizator | Data | 26 martie 2013 10:55:09 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n, k, a;
vector<char> v;
int main()
{
f>>n;
v.resize(n+1);
v[0]=v[1]=1;
for(int i=2; i<n; ++i)
if(!v[i]){
++k;
for(a=i+i; a<n; a+=i)
v[a]=1;
}
g<<k<<'\n';
g.close();
return 0;
}