Pagini recente » Cod sursa (job #1900287) | Cod sursa (job #2887991) | Cod sursa (job #2074558) | Borderou de evaluare (job #2619428) | Cod sursa (job #1338063)
#include<fstream>
#define N 2000000
using namespace std;
int main(){
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
long n,i,j;
bool ciur[N+1];
fin>>n;
for(i=1;i<=n;i++) ciur[i]=true;
int cnt=0;
for(i=2;i<=n;i++)
if(ciur[i]=true)
{ cnt++;
for(j=i+i;j<=n;j=j+i)
ciur[j]=false;
}
fout<<cnt;
fin.close();
fout.close();
//incarca l
return 0;
}