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
样例输出
-
5555533
一切皆在代码中(我加了足够的注释)
#include<stdio.h>
int main()
{
int V;
while(scanf("%d",&V) == 1)
{
int array[10];
int min = 10001;
for(int i = 1; i <= 9; i++)
{
scanf("%d",&array[i]);
//确定最小的耗油量
if(array[i] <= min)
min = array[i];
}
//判断是否有解
if(min > V)
{
printf("-1\n");
continue;
}
//确定数字的位数
int bit = V / min;
//打印输出解
while(bit--)
{
for(int i = 9; i >= 1; i--)
{
if(V >= array[i] && (V - array[i]) / min == bit )
{
printf("%d",i);
V -= array[i];
break;
}
}
}
printf("\n");
}
return 0;
}
本文内容由网友自发贡献,版权归原作者所有,本站不承担相应法律责任。如您发现有涉嫌抄袭侵权的内容,请联系:hwhale#tublm.com(使用前将#替换为@)