Cod sursa(job #2282862)
Utilizator | Data | 14 noiembrie 2018 17:11:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long long nr,i,j,a,p[2000005];
int main()
{
f>>a;
nr=0;
for(i=2;i<=a;i++) p[i]=true;
for(i=2;i*i<=a;i++)
if(p[i]==true)
for(j=i*2;j<=a;j+=i) p[j]=false;
for(i=2;i<=a;i++) if(p[i]==true) nr++;
g<<nr;
return 0;
}