Cod sursa(job #1365889)
Utilizator | Data | 28 februarie 2015 16:25:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.4 kb |
#include <iostream>
#include <fstream>
using namespace std;
bool v[2000001];
int main()
{
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n, i, j, s=0;
fin>>n;
for (i=2; i<n; i++)
for (j=2; j<=i/2; j++)
if (i%j==0)
v[i]=1;
for (i=2; i<n; i++)
if (v[i]==0)
s++;
fout<<s;
return 0;
}