Cod sursa(job #1850102)
| Utilizator | Data | 18 ianuarie 2017 10:32:43 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.58 kb |
#include <fstream>
#include <bitset>
#include <vector>
#define LL long long
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bitset <2000001> isp;
vector <int> pr;
int n, cont=0;
void ciur()
{
for(LL i=2; i<=n; i++)
{
if(!isp[i])
{
pr.push_back(i);
for(LL j=i*i; j<=n; j+=i)
{
isp[j]=1;
}
}
}
}
int main()
{
f>>n;
ciur();
for(int i=0; pr[i]<=n && pr[i]!=0; i++)
{
cont++;
}
g<<cont;
return 0;
}
