Cod sursa(job #2282498)
Utilizator | Data | 13 noiembrie 2018 20:35:02 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 90 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva educationala | Marime | 0.42 kb |
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
bool taiat[2000001];
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int n,i,j,nr=0;
fin>>n;
for(i=2;i<=n;i++)
{
if(taiat[i] == 0)
for(j=i+i;j<=n;j+=i)
taiat[j]=1;
}
for(i=2;i<=n;i++)
if(taiat[i]==0)
nr++;
fout<<nr;
return 0;
}