Pagini recente » Cod sursa (job #2916627) | Cod sursa (job #2202283) | Cod sursa (job #3281631) | Istoria paginii runda/9titus | Cod sursa (job #1045837)
#include <iostream>
#include <fstream>
#include <math.h>
#include <vector>
using namespace std;
ifstream fin; ofstream fout;
//char p[2000000/2+1];
int n,c=1,i,j;
vector<char> p;
int f(int nr)
{
p=vector<char>(nr/2+1, 0);
c=1;
for(i=1; (i<<1)+1<=nr;i+=1)
if(p[i]==0){
c++;
for(j=i+i+i+1;(j<<1)+1<=nr;j+=(i<<1)+1)
p[j]=1;
}
return c;
}
int main()
{
fin.open("ciur.in"); fout.open("ciur.out");
fin>>n;fin.close();
cout<<f(n);
fout<<c<<"\n";fout.close();
return 0;
}