Cod sursa(job #2547700)
Utilizator | Data | 15 februarie 2020 16:37:21 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.45 kb |
#include <iostream>
#include<fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int v[2000005],n;
void era(){
fin>>n;
v[0]=1;
v[1]=1;
for(int i=2;i<=n;i++)
for(int j=i+i;j<=n;j+=i)
if(v[j]==0)
v[j]=1;
}
int main()
{
era();
int nr=0;
//fin>>n;
for(int i=1;i<=n;i++)
if(v[i]==0)
nr++;
fout<<nr;
return 0;
}