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