Pagini recente » Cod sursa (job #1426000) | Cod sursa (job #1252773) | Cod sursa (job #645327) | Cod sursa (job #1116287) | Cod sursa (job #113686)
Cod sursa(job #113686)
using namespace std;
#include <cstdio>
#include <bitset>
#include <ctime>
#define maxn (1<<20)
int p, q, r, S;
bitset<maxn> a;
void read()
{
freopen("3-prim.in","r",stdin);
scanf("%d %d %d %d\n", &p, &q, &r, &S);
}
void solve()
{
int i, j, n=1000000;
a[1]=1;
for(i=p;i<=n;i+=p) a[i]=1;
for(i=q;i<=n;i+=q) a[i]=1;
for(i=r;i<=n;i+=r) a[i]=1;
for(i=2;i*i<=n;++i)
if(!a[i])
for(j=i+i;j<=n;j+=(i<<1)) a[j]=0;
for(i=1;i<=S;++i) if(a[i]) printf("%d ", i);
printf("\n");
}
int main()
{
read();
double s=clock();
solve();
printf("%lf\n", (clock()-s)/(double)CLOCKS_PER_SEC);
return 0;
}