Cod sursa(job #499626)
Utilizator | Data | 10 noiembrie 2010 15:09:16 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.34 kb |
#include <fstream>
using namespace std;
int ok[30000],i,j,n,k;
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
memset(ok,1,sizeof(ok));
for(i=2;i*i<=n;i++)
if(ok[i])
{
j=2;
while(i*j<=n)
{
ok[i*j]=0;
j++;
}
}
for(i=2;i<=n;i++)
if(ok[i])
k++;
g<<k;
return 0;
}