Cod sursa(job #1235055)
Utilizator | Data | 28 septembrie 2014 17:27:56 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int i, n, j, z;
bool v[2000001];
int main()
{
fin>>n;
for(i=2;i<=n/2;i++)
{
if(v[i]==0)
{
for(j=2;i*j<=n;j++)
{
v[i*j]=1;
}
}
}
for(i=2;i<=n;i++)
{
if(v[i]==0)
z++;
}
fout<<z;
return 0;
}