Cod sursa(job #1637258)
| Utilizator | Data | 7 martie 2016 16:05:39 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.43 kb |
#include <fstream>
#include <bitset>
using namespace std;
bitset<2000005>s;
int n,nrp;
void ciur()
{
int i,j;
++nrp;
for(i=3;i<=n;i+=2)
{
if(s[i] == 0)
{
++nrp;
for(j=3;j*i<=n;j+=2) s[i*j]=1;
}
}
}
int main()
{
ifstream f("ciur.in");
ofstream g("ciur.out");
f>>n;
if(n < 2) {g<<0<<"\n";return 0;}
nrp=0;
ciur();
g<<nrp<<"\n";
return 0;
}
