1 solutions
-
0
C++ :
#include<bits/stdc++.h> using namespace std; int n,q; int a[1010]; struct reader{ int len,code,book; }r[1010]; int main(){ cin>>n>>q; for(int i=1;i<=n;i++) cin>>a[i]; for(int i=1;i<=q;i++){ cin>>r[i].len>>r[i].code; r[i].len=pow(10,r[i].len); r[i].book=INT_MAX; for(int j=1;j<=n;j++){ if(a[j]%r[i].len==r[i].code) r[i].book=min(a[j],r[i].book); } if(r[i].book==INT_MAX) r[i].book=-1; } for(int i=1;i<=q;i++){ cout<<r[i].book<<endl; } return 0; }
- 1
Information
- ID
- 9203
- Time
- 1000ms
- Memory
- 16MiB
- Difficulty
- (None)
- Tags
- # Submissions
- 0
- Accepted
- 0
- Uploaded By