Cod sursa(job #1584421)
Utilizator | Data | 30 ianuarie 2016 08:34:01 | |
---|---|---|---|
Problema | Ciurul lui Eratosthenes | Scor | 20 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 0.32 kb |
#include<fstream>
#include<bitset>
using namespace std;
ifstream fin("ciur.in");
ofstream fout("ciur.out");
bitset <1000> ciur;
int main()
{
int n,c=0,i,d;
fin>>n;
for(d=2;d*d<=n;d++)
if(ciur[d]==0)
for(i=d*d;i<=n;i=i+d)
ciur[i]=1;
for(i=2;i<=n;i++)
if(!ciur[i])
c++;
fout<<c;
return 0;
}