Cod sursa(job #1678828)
Utilizator | Data | 7 aprilie 2016 15:46:52 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool a[2000001];
long long i,j,n,nr;
int main()
{
f>>n;
for (i=1; i<=n; i++)
a[i]=true;
a[0]=a[1]=false;
for (i=2; i*i<=n; i++)
if (a[i]==true)
for (j=2*i; j<=n; j+=i)
a[j]=false;
for (i=2; i<=n; i++)
if (a[i]==true) nr++;
g<<nr;
return 0;
}