Pagini recente » Cod sursa (job #2550693) | Cod sursa (job #514824) | Cod sursa (job #3364551) | Cod sursa (job #3361612) | Cod sursa (job #3361814)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
const int LIM = 2000001;
bool ciur[LIM];
int main(){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
ciur[1] = 1;
ciur[4] = 1;
int n;
fin>>n;
int cnt=0;
for (int i=6; i<n; i+=6){
if (ciur[i-1]==0){
for (int j=(i-1)*2; j<n; j+=i-1)
ciur[j]=1;
cnt++;
}
if (ciur[i+1]==0){
for (int j=(i+1)*2; j<n; j+=i+1)
ciur[j]=1;
cnt++;
}
}
fout<<cnt+2;
}