Cod sursa(job #1331302)
| Utilizator | Data | 31 ianuarie 2015 15:11:45 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.55 kb |
#include <fstream>
using namespace std;
void ciur (int n, bool *v)
{
int i,j;
for (i=2; i*i<n; ++i)
{
for (j=i*2; j<n; j=j+i)
{
v[j]=0;
}
}
}
const int x=2000000;
bool v[x];
int main()
{
int n,nr=0,i;
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
for (i=2; i<n; ++i)
{
v[i]=1;
}
ciur(n,v);
for (i=2; i<n; ++i)
{
if (v[i]==1)
nr++;
}
g<<nr;
f.close ();
g.close ();
return 0;
}
