Pagini recente » Cod sursa (job #2231592) | Cod sursa (job #1475934) | Cod sursa (job #93506) | Cod sursa (job #1053494) | Cod sursa (job #1551077)
#include <iostream>
#include <fstream>
#define nmax 2000005
using namespace std;
int n,nr=0;
bool prim[nmax];
void read()
{
ifstream f("ciur.in");
f >> n;
}
int main()
{
read();
for(int i=2; i<=n; i++)
prim[i] = 1;
for(int i=2; i<=n; i++)
if(prim[i])
{
nr++;
for(int j=2*i; j<=n; j+=i)
prim[j] = 0;
}
ofstream g("ciur.out");
g << nr;
g.close();
return 0;
}