Cod sursa(job #2377660)
Utilizator | Data | 10 martie 2019 19:47:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
#include <iostream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000001];
int i, n, j, k;
int main()
{
fin>>n;
v[1]=1;
for(i=2; i<=n/2; i++)
{
if(v[i]==0)
{
for(j=i+i; j<=n; j=j+i)
{
v[j]=1;
}
}
}
for(i=1; i<=n; i++)
{
if(v[i]==0)
k++;
}
fout<<k;
return 0;
}