Pagini recente » Cod sursa (job #609105) | Cod sursa (job #645497) | Cod sursa (job #891527) | Cod sursa (job #3276000) | Cod sursa (job #760224)
Cod sursa(job #760224)
#include <cstdio>
#include <iostream>
#include <fstream>
#include <list>
#include <limits.h>
#include <stdio.h>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <stdio.h>
#include <algorithm>
#include <deque>
#include <string.h>
#include <string>
#define NMAX 2000002
using namespace std;
int next_p(int i, vector<bool> &prime)
{
for (int j=i+1;j<prime.size();j++)
if (prime[j]) return j;
return prime.size();
}
int main()
{
FILE* f = fopen("ciur.in","r");
FILE* g = fopen("ciur.out","w+");
int n;
fscanf(f,"%d",&n);
vector<bool> prime(n);
for (int i=0;i<n;i++)
prime[i] = 1;
for (int i=2;i<n;i=next_p(i,prime))
{
for (int j=2*i;j<=n;j+=i)
prime[j]=0;
}
int nr =0;
for (int i=2;i<=n;i++)
nr+=prime[i];
fprintf(g,"%d\n",nr);
fclose(f);
fclose(g);
return 0;
}