Pagini recente » Cod sursa (job #2059173) | Cod sursa (job #1740861) | Cod sursa (job #1497051) | Cod sursa (job #1041392) | Cod sursa (job #1723538)
#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout ("ciur.out");
int n;
int k = 0;
vector<int> sieve;
int main(){
fin>>n;
sieve.resize(n+1);
for (int i = 2; i <= n; ++i)
sieve[i] = 1;
for (int i = 2; i <= n; ++i)
{
if (sieve[i])
{
k++;
for (int j = i + i; j <= n; j += i)
{
sieve[j] = 0;
}
}
}
fout<<k;
return 0;
}