Pagini recente » Cod sursa (job #2336851) | Cod sursa (job #686185) | Cod sursa (job #953754) | Cod sursa (job #1212559) | Cod sursa (job #2322708)
#include <cmath>
#include <iostream>
#include <fstream>
#define NMAX 2000001
using namespace std;
int n, sol;
void Citire()
{
ifstream fin("ciur.in");
fin>>n;
fin.close();
}
void Solutie()
{
int i,j,p=0;
bool v[NMAX];
for (i=1;i<=n;i++)
v[i]=1;
v[1]=0;
for (i=2;i<=sqrt(n);i++)
if (v[i]==true)
{
//cout<<i<<"\n";
for (j=i;j*i<=n;j++)
{
//cout<<"\t"<<i*j<<" "<<v[i*j]<<"\n";
v[i*j]=0;
}
}
/**
p+=x e acelasi lucru cu p=p+x
*/
for (i=1;i<=n;i++)
p+=v[i];
sol=p;
}
void Afisare()
{
ofstream fout("ciur.out");
fout<<sol<<"\n";
fout.close();
}
int main()
{
Citire();
Solutie();
Afisare();
return 0;
}