Cod sursa(job #626436)
Utilizator | Data | 27 octombrie 2011 09:23:12 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.44 kb |
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
long n,i,k,j;
long v[2000003];
void init()
{
for (i=1;i<=n;i++)
v[i]=1;
}
int main()
{
f>>n;
init();
v[1]=0;
for (i=2;i<=n;i++)
{
for (j=2*i;j<=n;j+=i)
{
v[j]=0;
}
}
k=0;
for(i=1;i<=n;i++)
{
if (v[i]) k++;
}
g<<k<<'\n';
return 0;
}