选拔3 1005

最新推荐文章于 2023-03-20 21:06:08 发布

原创最新推荐文章于 2023-03-20 21:06:08 发布 · 589 阅读

CC 4.0 BY-SA版权

#include<cstdio>
#include<iostream>
#include<cstring>
#include<string>
#include<vector>
#include<algorithm>
#include<time.h>
const __int64 inf=(__int64)1<<31;
using namespace std;
int ans[1100000];
__int64 pr[20];
__int64 t[20];
__int64 p[20];
int n;
int main()
{
	int N;
	freopen("d:\\a.txt","w",stdout);
	__int64 X,Y;
	while(scanf("%d",&N),N)
	{
		for(int i=0;i<N;i++)
		{
			scanf("%I64d",&pr[i]);
			t[i]=1;
			p[i]=i;
		}
		scanf("%I64d%I64d",&X,&Y);
		n=0;
		__int64 minn=0;
		int pt;
		int flag=0,tmp=0;
		ans[n++]=1;
		if(1==X) flag=1;
		while(minn<=Y)
		{
			pt=0;
			minn=inf;
			for(int i=0;i<N;i++)
			{
				if(minn>pr[i]*t[i])
					minn=pr[i]*t[i];
			}
			if(!flag&&minn>=X) {tmp=n;flag=1;}
			ans[n++]=minn; 
			for(int i=0;i<N;i++)
			{
				if(minn==pr[i]*t[i])
				{
					p[i]++;
					t[i]=ans[p[i]];
				}
			}
		}
		if(ans[tmp]>Y)
			puts("none");
		else
		{
			printf("%d",ans[tmp++]);
			while(ans[tmp]<=Y&&tmp<n)
			{
				printf(",%I64d",ans[tmp++]);
			}
			puts("");
		}
	}
	printf("%lf\n",clock()/CLOCKS_PER_SEC);
	return 0;
}