Color the fence

最新推荐文章于 2021-09-07 19:41:04 发布

原创最新推荐文章于 2021-09-07 19:41:04 发布 · 227 阅读

0 ·

CC 4.0 BY-SA版权

Tom用有限的油漆在围栏上写出了他对Mary的爱意，通过数学计算找到最大的数字来展示他的深情。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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 integer V(0≤V≤10^6).
The second line contains nine positive integers a1,a2,……，a9(1≤ai≤10^5).

输出

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

样例输入

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

样例输出

源代码如下：

#include<stdio.h>
int main()
{
int i,j,v,a[10];
while(scanf("%d",&v)!=EOF)
{
int t=0;
for(i=1;i<=9;i++)
{
scanf("%d",&a[i]);
}
int min=a[1];
for(i=1;i<=9;i++)
{
if(min>=a[i])
{
min=a[i];
}
}
for(i=v/min;i>=1;i--)//计算最多能刷几个数字（包含相同的数字或者不同的数字）

{
for(j=9;j>=0;j--)
{
if(v>=a[j]&&(v-a[j])/min>=i-1)//判断j数字能否被刷，且剩余的涂料可以刷剩下的i-1个数字
{
printf("%d",j);
v-=a[j];
break;
}
}
}
printf("\n");
}
return 0;
}