Cod sursa(job #1012824)
Utilizator | Data | 19 octombrie 2013 18:09:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
int main()
{
ifstream f("ciur.in");
ofstream g ("ciur.out");
bool pr[2000001];
long n,i,j,nr=0;
f>>n;
for (i=2;i<=n;i++)
pr[i]=1;
for (i=2; i<= sqrt(n); i++)
if (pr[i])
for (j=i;j<=n/i;j++)
pr[i*j]=0;
for (i=2;i<=n;i++)
if (pr[i]) nr++;
g<<nr;
return 0;
}