代码:
#include<bits/stdc++.h>
using namespace std;
const int maxn = 1000 + 10;
int book[maxn],mod[9]={1,10,100,1000,10000,100000,100000,1000000};
int n,q;
int main(){
cin>>n>>q;
for(int i=1;i<=n;i++)
cin>>book[i];
sort(book+1,book+n+1);
for(int i=1;i<=q;i++){
int now,len,flag=0;
cin>>len>>now;
for(int j=1;j<=n;j++){
if(book[j]%mod[len]==now){
cout<<book[j]<<endl;
flag=1;
break;
}
}
if(flag==0) cout<<-1<<endl;
}
return 0;
}
救救孩子吧!
#10挂了
记录