Cod sursa(job #1003371)
Utilizator | Data | 30 septembrie 2013 16:01:07 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,nr,n,j;
bool a[2000002];
int main()
{
f>>n;nr=n-1;
for(i=2;i<=n;++i) a[i]=true;for(i=4;i<=n;i+=2) {a[i]=false;nr--;}
for(i=3;i<=n/2;++i)
{
if(a[i])
for(j=2*i;j<=n;j+=i)
{if(a[j]) --nr; a[j]=false;}
}
g<<nr<<'\n';
return 0;
}