Cod sursa(job #1976476)
Utilizator | Data | 3 mai 2017 15:20:40 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
using namespace std;
bool ciur[2000001];
ifstream in ("ciur.in");
ofstream out ("ciur.out");
int main()
{
int d,i,n,x=0;
in>>n;
for (i=2;i<=n;i++)
{
if (ciur[d]==0)
{
for (i=d*2;i<=n;i+=d)
{
ciur[i]=1;
}
}
}
for (i=2;i<=n;i++)
{
if (ciur[i]==0)
x++;
}
out<<x;
return 0;
}