Cod sursa(job #1851263)
Utilizator | Data | 19 ianuarie 2017 16:13:43 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.41 kb |
#include <iostream>
#include <fstream>
#include <math.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int main()
{
bool a[2000001];
int nr=0, n, i, j;
f>>n;
for (i=1;i<=n;i++)
a[i]=1;
for (i=2;i<=sqrt(n);i++)
{
for (j=i;j<=n/i;j++)
a[i*j]=0;
}
for (i=2;i<=n;i++)
if (a[i]==1) nr++;
g<<nr;
return 0;
}