Cod sursa(job #754293)
| Utilizator | Data | 1 iunie 2012 15:26:54 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.4 kb |
#include<fstream>
using namespace std;
const int W=2000000;
bool c[W];
int ciur (int n)
{
int i,j,nr=0;
for (i=2; i*i<=n; i++)
if(!c[i])
for (j=i*i;j<=n; j+=i)
c[j]=true;
for(i=2 ; i<=n ; i++)
if(!c[i])
nr++;
return nr;
}
int main ()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
int n,x;
f>>n;
x=ciur(n);
g<<x;
f.close ();
g.close ();
return 0;
}
