Pagini recente » Cod sursa (job #2349032) | Cod sursa (job #2547737) | Cod sursa (job #1849155) | Cod sursa (job #901935) | Cod sursa (job #341795)
Cod sursa(job #341795)
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
using namespace std;
#define mp make_pair
#define pb push_back
#define sz(c) (int)((c).size())
#define f first
#define s second
#define fin "ciur.in"
#define fout "ciur.out"
#define NMAX 2000001
int main()
{
int N;
char v[NMAX];
int i, j, count = 1;
ifstream f(fin);
ofstream f2(fout);
f >> N;
memset(v,0,sizeof(v));
for ( i = 3; i <= N; i += 2 )
if ( !v[i] )
{
++count;
for ( j = 3; i * j <= N; j += 2 )
v[ i * j ] = 1;
}
f2 << count << endl;
return 0;
}