Cod sursa(job #2277559)
| Utilizator | Data | 6 noiembrie 2018 15:33:07 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva educationala | Marime | 0.56 kb |
#include <iostream>
#include <fstream>
#include <bitset>
#include <vector>
#define LL long long
#define NMAX 2000005
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int i,n,j,cont;
bitset <NMAX> numarprim;
vector <int> pr;
void ciur()
{
for(LL i=2;i<=NMAX;i++)
if(numarprim[i]==0)
{
for(LL j=i*i;j<=NMAX;j=j+i)
numarprim[j]=1;
pr. push_back(i);
}
}
int main()
{
f>>n;
ciur();
for(i=0;pr[i]<=n;i++)
cont++;
g<<cont;
return 0;
}
