Cod sursa(job #2108056)
| Utilizator | Data | 17 ianuarie 2018 21:10:23 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 30 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.45 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
bitset<3000002>v;
long long nrp,n;
inline void ciur(long long n)
{
for(int i=4;i<=n;i+=2)
v[i]=1;
++nrp;
for(int i=3;i<=n;i+=2)
if(!v[i])
{
++nrp;
for(long long j=i*i;j<=n;j+=i)
v[j]=1;
}
}
int main()
{
f>>n;
ciur(n);
g<<nrp;
return 0;
}
