This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define f first
#define s second
#define endl '\n'
#define all(x) begin(x), end(x)
ll k,q,d,m,n;
vector<ll> ans;
ll arr[5069];
bool find(ll x) {
for (int i = 0; i < d; i++) {
if (arr[i]==x) {
ans.push_back(arr[i]);
return true;
}
if ((x-arr[i])%k==0) {
if (find((x-arr[i])/k)) {
ans.push_back(arr[i]);
return true;
}
}
}
return false;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
cin>>k>>q>>d>>m;
for (int i = 0; i < d; i++) {
cin>>arr[i];
}
for (int t = 0; t < q; t++) {
ans.clear();
cin>>n;
if (find(n)) {
for (auto i : ans) {
cout<<i<<' ';
}
cout<<endl;
}
else {
cout<<"IMPOSSIBLE";
}
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |