Cod sursa(job #2028244)
Utilizator | Data | 27 septembrie 2017 15:47:35 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.47 kb |
#include <fstream>
using namespace std;
ifstream fi("ciur.in");
ofstream fo("ciur.out");
int n,nr;
bool X[2000001];
void ciur(void)
{
for(int i=2; i<=n; i++)
X[i]=1;
for(int i=2; i*i<=n; i++)
if(X[i])
for(int j=2; i*j<=n; j++)
X[i*j]=0;
for(int i=1; i<=n; i++)
if(X[i])
nr++;
}
int main()
{
fi>>n;
ciur();
fo<<nr;
fi.close();
fo.close();
return 0;
}