Cod sursa(job #752571)
| Utilizator | Data | 28 mai 2012 22:09:52 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include<fstream>
#include<bitset>
using namespace std;
ifstream f("ciur.in");
ofstream g("ciur.out");
int nr,n,i,j;
bitset<2000000>p;
int main()
{
// freopen("ciur.in","r",stdin);
// freopen("ciur.out","w",stdin);
// scanf("%d",&n);
f>>n;
p[1]=1;
nr=0;
for(i=2;i<=n;++i)
{
if(p[i]==0)
{
++nr;
// a[k]=i;
}
for(j=i+i;j<=n;j=i+j)
{
p[j]=1;
}
}
//printf("%d\n",nr);
g<<nr<<'\n';
return 0;
}
