Cod sursa(job #2162238)
Utilizator | Data | 12 martie 2018 09:20:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.5 kb |
#include <fstream>
# define NMax 2000001
using namespace std;
ifstream f ("ciur.in");
ofstream g ("ciur.out");
int n,i,k,j,x;
bool viz[NMax+7];
int main()
{
f>>n;
for(i=2;i<=n;i++)
{
if(viz[i]==0)
{
for(j=2;j*i<=n;j++)
viz[j*i]=1;
}
}
k=0;
for(i=2;i<=n;i++)
{
if(viz[i]==0)
k++;
}
g<<k;
return 0;
}