Cod sursa(job #255961)
Utilizator | Data | 10 februarie 2009 21:46:25 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include <fstream>
using namespace std;
#define nmax 10000
int main()
{
long n,ciur[nmax],i,j,rez=0;
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
for(i=2;i<=n;i++)
ciur[i]=1;
for(i=2;i*i<=n;i++)
for(j=2;j*i<=n;j++)
ciur[i*j]=0;
for(i=2;i<=n;i++)
if(ciur[i])
rez++;
out<<rez<<'\n';
}