Pagini recente » Cod sursa (job #2494863) | Cod sursa (job #2091538) | Cod sursa (job #3254695) | Cod sursa (job #604222) | Cod sursa (job #1455440)
#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <cmath>
#include <iomanip>
#include <vector>
#include <queue>
#include <bitset>
#include <cstdlib>
#include <algorithm>
#define x first
#define y second
using namespace std;
ifstream in("ciur.in");
ofstream out("ciur.out");
bool a[2000006];
void ciur(int n)
{
for(int i=2;i<=n;i++)
{
if(a[i]==0)
{
for(int j=2;i*j<=n;j++)
a[i*j]=1;
}
}
}
int n, i,nr=0;
int main()
{
in.sync_with_stdio(false);
out.sync_with_stdio(false);
in>>n;
ciur(n);
for(i=2;i<=n;i++)
if(a[i]==0) nr++;
out<<nr;
return 0;
}