Pagini recente » Cod sursa (job #1435943) | Cod sursa (job #1307175) | Cod sursa (job #504579) | Cod sursa (job #2215124) | Cod sursa (job #3128746)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bool erath[2000005];
int main()
{
int n;
int cnt=0;
f>>n;
for(int div = 2;div*div<=n;div++){
if(erath[div]==1){
continue;
}
for(int multiplu = 2*div;multiplu<=n;multiplu+=div){
erath[multiplu]=1;
}
}
for(int i = 2;i<=n;i++){
if(erath[i]==0){
cnt++;
}
}
g<<cnt;
return 0;
}