Cod sursa(job #2170694)
Utilizator | Data | 15 martie 2018 09:24:52 | |
---|---|---|---|
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 n,i,j;
bool fv[2000010];
void ciur(int n)
{
int nr=0;
fv[1]=1;
for(i=2;i<=n;i++)
{
if(fv[i]==0)
{
for(j=2*i;j<=n;j+=i)
fv[j]=1;
nr++;
}
}
fout<<nr;
}
int main()
{
fin>>n;
ciur(n);
fin.close();
fout.close();
return 0;
}