Cod sursa(job #1617876)
Utilizator | Data | 27 februarie 2016 16:55:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int main()
{
int n;
fin>>n;
char v[n];
for (int i=2;i<=n;i+=2) {
v[i-1]=1;
v[i]=0;
}
int nr_p=1;
for (int i=2;i<=n;i++) {
if (v[i]) {
nr_p++;
for (int j=i+i;j<=n;j+=i) v[j]=0;
}
}
fout<<nr_p;
}