Pagini recente » Cod sursa (job #2522835) | Cod sursa (job #2643282) | Cod sursa (job #224088) | Cod sursa (job #2931334) | Cod sursa (job #3121660)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int IsPrime [1000000];
void Ciur(){
IsPrime[0] = 0;
IsPrime[1] = 0;
for (int i=2;i<=1000000;++i){
IsPrime[i] = 1;
}
for (int i=2;i<=1000000;++i){
for (int j=2*i;j<=1000000;j+=i){
IsPrime[j] = 0;
}
}
}
int main()
{
Ciur();
int n;
fin >> n;
int Raspuns = 0;
for (int i=2;i<=n;++i){
if(IsPrime[i]==1){
Raspuns += 1;
}
}
fout << Raspuns;
return 0;
}