Pagini recente » Cod sursa (job #3128038) | Cod sursa (job #2228707) | Cod sursa (job #2518928) | Clasament infogang | Cod sursa (job #2189015)
#include <iostream>
#include <cmath>
#include <fstream>
using namespace std;
int main(){
ifstream f("ciur.in");
ofstream o("ciur.out");
int n,nprime=0;
bool v[2000001];
f>>n;
int i,j;
for(i=2;i<=n;i++)
v[i]=true;
for(i=2;i<=sqrt(n);i++)
if(v[i])
for(j=i*i;j<=n;j=j+i)
v[j]=false;
for(i=2;i<=n;i++)
if(v[i])
nprime++;
o<<nprime;
f.close();
o.close();
return 0;
}