Pagini recente » Borderou de evaluare (job #1797211) | Borderou de evaluare (job #2380999) | Diferente pentru tree-decompositions intre reviziile 1 si 2 | Borderou de evaluare (job #2328723) | Cod sursa (job #679013)
Cod sursa(job #679013)
#include<fstream>
using namespace std;
int n,k=1;
bool v[2000010];
void ciur() {
int i,j;
for(i=3;i<=n;i+=2)
if(v[i]==0) {
k++;
if(i*i>0)
for(j=i*i;j<=n;j=j+i)
v[j]=1;
}
}
int main()
{
ifstream in("ciur.in");
ofstream out("ciur.out");
in>>n;
ciur();
out<<k<<'\n';
in.close();
out.close();
return 0;
}