Cod sursa(job #481791)
Utilizator | Munteanu Valentin CyberneticLord | Data | 1 septembrie 2010 18:17:18 |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.53 kb |
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int getTheNumber(int n)
{
int p[1000];
for(int k=0;k<1000;k++)
p[k]=0;
int i, j, nr = 0;
for (i = 2; i <= n; ++i)
{
if (p[i] == 0)
{
nr++;
for (j = i + i; j <= n; j += i)
{
p[j] = 1;
}
}
}
return nr;
}
int main()
{
int n;
fin>>n;
fout<<getTheNumber(n);
fin.close();
fout.close();
return 0;
}