Cod sursa(job #1972993)
Utilizator | Data | 24 aprilie 2017 10:37:44 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.37 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,j,nr,n;
bool a[2000005];
int main()
{
f>>n;
for(i=2;i*i<=n;i++)
{
if(a[i]==false)
{
for(j=i*i;j<=n;j=j+i) a[j]=true;
}
}
for(i=2;i<=n;i++)
{
if(a[i]==false) nr++;
}
g<<nr;
return 0;
}