Cod sursa(job #1354396)
Utilizator | Data | 21 februarie 2015 20:02:47 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,nr;
bool v[2000000];
int main()
{
fin>>n;
for(int i=2; i<=n; i++)
{
if(v[i]==0)
{
for(int j=2;j<=n/i;j++)
{
v[i*j]=1;
}
}
if(v[i]==0)
nr++;
}
fout<<nr;
fin.close();
fout.close();
return 0;
}