Cod sursa(job #1958544)
Utilizator | Data | 8 aprilie 2017 14:42:04 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <fstream>
using namespace std;
ifstream in ("ciur.in");
ofstream out ("ciur.out");
bool v[2000001];
int main()
{
int n,i,z,gigi=0;
in>>n;
v[0]=1;
v[1]=1;
for (i=2;i<=n;i++)
{
if (v[i]==0)
{
for (z=i+i;z<=n;z+=i)
{
v[z]=1;
}
gigi++;
}
}
out<<gigi;
return 0;
}