Cod sursa(job #1548367)
Utilizator | Data | 10 decembrie 2015 20:33:32 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool ciur[2000000];
int main()
{
int n,m,i,ctr=0;
in>>n;
ciur[0]=1;
ciur[1]=1;
for (i=2;i<=n;i++)
ciur[i]=1;
for (i=2;i<=n;i++)
{
m=i;
if (ciur[i]==0)
{
while (m<=n)
{
m=m+i;
ciur[m]=1;
}
}
}
for(i=2;i<=n;i++)
{
if(ciur[i]==1)
ctr++;
}
out<<ctr;
return 0;
}