Cod sursa(job #1972818)
Utilizator | Data | 23 aprilie 2017 19:26:13 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,a[4000001],i,d,nr;
int main()
{
f>>n;
a[0]=1;
a[1]=1;
for(i=2;i*i<=n;i++)
{
if(a[i]==0)
for(d=i*i;d<=n;d=d+i)
a[d]=1;
}
nr=0;
for(i=2;i<=n;i++)
if(a[i]==0)nr++;
g<<nr;
return 0;
}