# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
854022 | 2023-09-25T20:33:23 Z | Lobo | Weird Numeral System (CCO21_day1problem2) | C++17 | 0 ms | 344 KB |
#include<bits/stdc++.h> using namespace std; const long long inf = (long long) 1e18 + 10; const int inf1 = (int) 1e9 + 10; #define int long long #define dbl long double #define endl '\n' #define sc second #define fr first #define mp make_pair #define pb push_back #define all(x) x.begin(), x.end() const int maxn = -1; void solve() { int k,q,d,m; cin >> k >> q >> d >> m; vector<int> a; for(int i = 1; i <= d; i++) { int x; cin >> x; a.pb(x); } while(q--) { int n; cin >> n; vector<int> ans; while(n != 0) { bool ok = false; for(auto x : a) { if((x%k+k)%k == (n%k+k)%k) { n-= x; n/= k; ok = true; ans.pb(x); break; } } if(!ok) { break; } } if(n != 0) { cout << "IMPOSSIBLE" << endl; } else { reverse(all(ans)); for(auto x : ans) cout << x << " "; cout << endl; } } } int32_t main() { ios::sync_with_stdio(false); cin.tie(0); // freopen("in.in", "r", stdin); // freopen("out.out", "w", stdout); int tt = 1; // cin >> tt; while(tt--) { solve(); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Query 1: Jury has an answer but participant does not |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 0 ms | 344 KB | Query 1: Jury has an answer but participant does not |
2 | Halted | 0 ms | 0 KB | - |