Cod sursa(job #752057)
Utilizator | Data | 27 mai 2012 18:05:33 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.39 kb |
#include<fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int ciur(int n)
{
int i,j,nr=0,a[2000000];
for(i=2; i<=n; i++)
a[i] = 0;
for(i=1; i<=n; i++)
if(a[i] == 0)
{
nr++;
for(j=i; j<=n; j+=i)
a[i] = 1;
}
return nr;
}
int main()
{
int n;
f>>n;
g<<ciur(n);
f.close();
g.close();
return 0;
}