# Codeforces Round #202 (Div. 2) B. Color the Fence

264人阅读 评论(0)

B. Color the Fence
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Igor has fallen in love with Tanya. Now Igor wants to show his feelings and write a number on the fence opposite to Tanya's house. Igor thinks that the larger the number is, the more chance to win Tanya's heart he has.

Unfortunately, Igor could only get v liters of paint. He did the math and concluded that digit d requires ad liters of paint. Besides, Igor heard that Tanya doesn't like zeroes. That's why Igor won't use them in his number.

Help Igor find the maximum number he can write on the fence.

Input

The first line contains a positive integer v (0 ≤ v ≤ 106). The second line contains nine positive integers a1, a2, ..., a9 (1 ≤ ai ≤ 105).

Output

Print the maximum number Igor can write on the fence. If he has too little paint for any digit (so, he cannot write anything), print -1.

Examples
input
5
5 4 3 2 1 2 3 4 5

output
55555

input
2
9 11 1 12 5 8 9 10 6

output
33

input
0
1 1 1 1 1 1 1 1 1

output
-1

#include <cstdio>
#include <algorithm>
using namespace std;
int V;
int a[9];

int main()
{
while (scanf("%d", &V) != EOF){
int min1 = 1000000;
for (int i = 1; i <= 9; i++){
scanf("%d", &a[i]);
if (a[i] < min1)
min1 = a[i];
}
if (V < min1){
printf("-1\n");
continue;
}
for (int i = V / min1 - 1; i >= 0; i--){    //从最多可以染的数目开始
for (int j = 9; j > 0; j--){
//扫描所有的可以满足大于当前要染的数字，以及所要消耗的之后的剩余对min除还能保持>=i,就可以染当前的数字
if (V >= a[j] && (V - a[j]) / min1 >= i){
printf("%d", j);
V -= a[j];
break;
}
}
}
printf("\n");
}
return 0;
}

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：210141次
• 积分：5819
• 等级：
• 排名：第4373名
• 原创：396篇
• 转载：57篇
• 译文：0篇
• 评论：14条