Pagini recente » Cod sursa (job #1615896) | Cod sursa (job #662330) | Rating Pasoi Stefan (FMI_Pasoi_Stefan) | Cod sursa (job #2943698) | Cod sursa (job #1806126)
#include <iostream>
#include <fstream>
#include <bitset>
using namespace std;
bitset<2000001> p;
int main (){
ifstream fin("ciur.in");
ofstream fout("ciur.out");
int nr=1,n;
fin>>n;
for (int i=4; i<=n; i+=2)
p[i] = true;
for (int i=3; i<=n; i+=2)
if (p[i]==false){
++nr;
for (int j=i+i; j<=n; j+=i){
p[j] = true;
}
}
fout<<nr;
return 0;
}