Cod sursa(job #870177)
Utilizator | Data | 2 februarie 2013 22:34:42 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.38 kb |
#include<fstream>
#include<math.h>
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
int i,n,nr=1,j;
char ok[2000001];
int ciur()
{
i=3;
while (i<=(int)sqrt((float)n))
{
if (!ok[i])
for (j=i*i;j<=n;j+=i)
ok[j]=1;
i+=2;
}
for (i=3;i<=n;i+=2)
if (!ok[i]) nr++;
return nr;
}
int main()
{
in>>n;
out<<ciur();
}