Cod sursa(job #2374283)
Utilizator | Data | 7 martie 2019 17:47:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include <math.h>
#include <fstream>
using namespace std;
int main()
{
bool a[2000001];
long long int i,j,n,nr;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
fin>>n;
for(i=1; i<=n; i++)
a[i]=1;
for(i=2; i<=n; i++)
if(a[i])
for(j=i; j<=n; j++)
a[i*j]=0;
for(i=2; i<=n; i++)
if(a[i])
nr++;
fout<<nr;
return 0;
}