-
Notifications
You must be signed in to change notification settings - Fork 3
/
Copy pathb.cpp
56 lines (51 loc) · 1.39 KB
/
b.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
template <typename T1, typename T2>
ostream &operator <<(ostream &os, pair<T1, T2> p){os << p.first << " " << p.second; return os;}
template <typename T>
ostream &operator <<(ostream &os, vector<T> &v){for(T i : v)os << i << ", "; return os;}
template <typename T>
ostream &operator <<(ostream &os, set<T> s){for(T i : s) os << i << ", "; return os;}
template <typename T1, typename T2>
ostream &operator <<(ostream &os, map<T1, T2> m){for(pair<T1, T2> i : m) os << i << endl; return os;}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int v; cin >> v;
int c[9];
for(int i = 0; i < 9; i++){
cin >> c[i];
}
int midx1 = 0;
int mval1 = 100000000;
for(int i = 0; i < 9; i++){
if(c[i] <= mval1){
mval1 = c[i];
midx1 = i;
}
}
int n = v / mval1;
int r = v % mval1;
string ans;
for(int i = 0; i < v/mval1; i++){
ans += (char)(midx1 + 49);
}
for(int i = 0; i < n; i++){
r += mval1;
for(int j = 9; j >= 1; j--){
if(c[j-1] <= r){
ans[i] = (char)(j + 48);
r -= c[j-1];
}
}
}
if(ans.length() == 0){
cout << -1 << endl;
}else{
cout << ans << endl;
}
return 0;
}