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)
int k, q, d, m;
int a;
map<int, bool> done;
vector<int> vctr, ans;
bool dp(int x) {
if (done[x]) return false;
done[x] = true;
if (!x) return true;
for (auto i : vctr) if ((x - i) % k == 0) {
if (dp((x - i) / k)) {
ans.push_back(i);
return true;
}
}
return false;
}
int main() {
ios_base::sync_with_stdio(0);
cin.tie(NULL);
cin>>k>>q>>d>>m;
for (int i = 0; i < d; i++) {
cin>>a;
vctr.push_back(a);
}
for (int i = 0; i < q; i++) {
done.clear();
ans.clear();
cin>>a;
if (dp(a)) {
for (auto j : ans) cout<<j<<' ';
cout<<endl;
}
else cout<<"IMPOSSIBLE"<<endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |