Cod sursa(job #2175191)
Utilizator | Data | 16 martie 2018 15:51:45 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.36 kb |
#include <fstream>
#define maxim 2000000
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool c[maxim];
int n,a;
int main ()
{
fin>>n;
for(int i=2;i*i<maxim&&i<=n;++i){
if(c[i]==0){
++a;
for(int j=i*i;j<=n;j+=i)
c[j]=1;
}
}
fout<<a;
return 0;
}