Cod sursa(job #2120736)
Utilizator | Data | 2 februarie 2018 20:30:28 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 80 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool v[2000001];
int main()
{
long n;
fin>>n;
int i,c=1;
v[1]=1;
for(i=3;i<=n;i+=2)
{
if(v[i]==0)
{
c++;
for(int j=2*i;j<=n;j+=i)
v[j]=1;
}
}
fout<<c;
return 0;
}