acm-Color the fence

最新推荐文章于 2018-03-06 21:51:00 发布

原创最新推荐文章于 2018-03-06 21:51:00 发布 · 734 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

NYOJ 专栏收录该内容

65 篇文章

订阅专栏

本文概述了AI音视频处理领域的关键技术，包括视频分割、语义识别、自动驾驶、AR、SLAM、物体检测与识别、语音识别变声等，为读者提供了一个全面的技术视角。

Color the fence

时间限制： 1000 ms | 内存限制： 65535 KB

难度： 2

描述

Tom has fallen in love with Mary. Now Tom wants to show his love and write a number on the fence opposite to

Mary’s house. Tom thinks that the larger the numbers is, the more chance to win Mary’s heart he has.

Unfortunately, Tom could only get V liters paint. He did the math and concluded that digit i requires ai liters paint.

Besides,Tom heard that Mary doesn’t like zero.That’s why Tom won’t use them in his number.

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

输入

There are multiple test cases.
Each case the first line contains a nonnegative integerV(0≤V≤10^6).
The second line contains nine positive integersa1,a2,……，a9(1≤ai≤10^5).

输出

Printf the maximum number Tom can write on the fence. If he has toolittle paint for any digit, print -1.

样例输入

5
5 4 3 2 1 2 3 4 5
2
9 11 1 12 5 8 9 10 6

样例输出

55555
33

来源

CodeForce

代码：

#include
#include
#include
using namespace std;

int main()
{
int n,a[10], m, index;
//scanf("%d", &n);
while(scanf("%d",&n)!=EOF)
{
m = 0x7fffffff;
for (int i =1; i <= 9; ++i)
{
scanf("%d", &a[i]);
if (a[i] <= m)
{
m = a[i];
index = i;
}
}
if (n <m)
{
printf("-1\n");
}
int k = n /m;
for (int i =k - 1; i >= 0; --i)
{
for (int j = 9; j >= 1; --j)
{
if (n >= a[j] && (n - a[j]) / m >=i)
{
printf("%d", j);
n -= a[j];
break;
}
}
}
printf("\n");
}
return0;
}