Pagini recente » Cei mai harnici utilizatori info-arena | Clasament arhiva | Cod sursa (job #3135270) | Borderou de evaluare (job #1559969) | Cod sursa (job #1308453)
#include <iostream>
#include <fstream>
using namespace std;
#define nmax 2000005
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
bool v[nmax];
int i, n, j, nr;
int main(){
fin >> n;
for(i=4; i<=n; i+=2) v[i] = true;
for(i=3; i<=n; i+=2)
if(v[i]==0)
for(j=i*2; j<=n; j+=i) v[j]=true;
for(i=2; i<=n; i++)
if (!v[i]) nr++;
fout << nr;
return 0;
}