Cod sursa(job #1241446)
Utilizator | Data | 13 octombrie 2014 16:01:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include <cmath>
#include <fstream>
using namespace std;
bool a[2000000];
int main()
{
int nr=0,n,i,j;
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
a[2]=1;
for(i=3;i<=n;i=i+2)
a[i]=1;
for(i=3;i<=sqrt(n);i=i+2)
for(j=1;j<=n/i;j++)
a[i*j]=0;
if(n>2)
nr++;
for(i=3;i<=n;i=i+2)
if(a[i])
nr++;
out<<nr;
return 0;
}