Cod sursa(job #663586)
Utilizator | Data | 18 ianuarie 2012 18:49:48 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
#define NMax 200000
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int ciur[NMax];
int main ()
{
int i,j,n,nr=0;
f>>n;
for (i=2;i*i<=n;i++)
if(ciur[i]!=1)
for (j=2;i*j<=n;j++)
ciur[i*j]=1;
for (i=1;i<=n;i++)
if(ciur[i]==0)
nr++;
g<<nr;
return 0;
}