Cod sursa(job #983439)
| Utilizator | Data | 11 august 2013 20:08:20 | |
|---|---|---|---|
| Problema | Ciurul lui Eratosthenes | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Arhiva educationala | Marime | 0.51 kb |
#include <fstream>
#include <cmath>
using namespace std;
ifstream f("maxd.in");
ofstream g("maxd.out");
bool a[100000];
int b[48000],p,u,i,j,n,nr,ma,ii,pp,nrdiv,nrr,r;
int main()
{
f>>u;
for (i=3;i*i<=u;i+=2)
for (j=i*i;j<=u;j+=i)
a[j]=1;
b[2]=1;
for (i=1;i<=u;i++)
g<<a[i]<<" ";
for (i=3;i<=u;i++)
if (a[i]==0 && i%2)
b[i]=b[i-1]+1;
else
b[i]=b[i-1];
g<<b[u];
f.close();
g.close();
}
