#include<iostream>
#include<algorithm>
using namespace std;
const int maxn=400000+5;
int v[maxn],cnt;
int main()
{
int n,m;
int a[10];
while(~scanf("%d%d",&n,&m))
{
cnt=0;
for(int i=1;i<=n;i++) scanf("%d",&a[i]);
sort(a+1,a+1+n);
do{
if(a[1]){
int tmp=0;
for(int i=1;i<=n;i++) tmp=tmp*10+a[i];
v[cnt++]=tmp;
}
}while(next_permutation(a+1,a+1+n));
while(m--)
{
int x,k;
scanf("%d%d",&x,&k);
int ans=-1;
for(int i=0;i<cnt;i++){
if((v[i]+x)%k==0) {ans=v[i];break;}
}
if(ans!=-1) printf("%d\n",ans);
else printf("None\n");
}
}
return 0;
}
HDU 1755 A Number Puzzle
最新推荐文章于 2020-10-27 06:55:10 发布