Pagini recente » Cod sursa (job #971125) | Borderou de evaluare (job #152531) | Cod sursa (job #161769) | Cod sursa (job #755258) | Cod sursa (job #1338053)
#include<fstream>
#define N 2000000
using namespace std;
int main(){
long n,i,j;
bool ciur[N+1];
for(i=1;i<=n;i++) ciur[i]=true;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int cnt=0;
fin>>n;
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;
}