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