Pagini recente » razvy_round1 | Istoria paginii runda/cel_mai_mare_olimpicar_2019_baraj_2012 | Diferente pentru preoni-2006/runda-1/solutii intre reviziile 15 si 26 | Cod sursa (job #1342612) | Cod sursa (job #983492)
Cod sursa(job #983492)
#include <iostream>
#include <fstream>
#include <cstring>
#include <string>
#include <climits>
#include <algorithm>
using namespace std;
ifstream fin ("ciur.in");
ofstream fout("ciur.out");
#define MAX 801
int n,i,j;
bool a[2000001];
int main()
{
fin>>n;
int k=1;
for(i=3;i<=n;i+=2)
{
if(!a[i])
{
k++;
for(j=2;i*j<=n;j++)
{
a[i*j]=1;
}
}
}
fout<<k;
return 0;
}