Pagini recente » Cod sursa (job #2540273) | Borderou de evaluare (job #2965877) | Cod sursa (job #2306452) | Cod sursa (job #3195276) | Cod sursa (job #916118)
Cod sursa(job #916118)
#include <fstream>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bool Prime[10000];
int n, count;
void Read();
void Erathostenes();
int main()
{
Read();
Erathostenes();
fin.close();
fout.close();
return 0;
}
void Read()
{
fin >> n;
}
void Erathostenes()
{
for( int i = 2; i <= n; i++ )
{
Prime[i] = true;
}
for( int i = 2; i <= n; i++ )
{
if(Prime[i] == true)
{
count++;
for( int j = 2 * i; j <= n; j += i )
Prime[j] = false;
}
}
fout << count;
}