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<iostream> #include<algorithm> #include<cmath> #include<cstdio> using namespace std; int main() { int n; int s[11]; while(scanf("%d",&n)!=EOF) { int min= 0x3f3f3f3f;//设它为最大值; for(int i=1;i<10;i++) { int num; cin>>num; if(num<min) { min=num; } s[i]=num; } for(int i=n/min-1;i>=0;i--)//从最大的可以染的颜色开始 { for(int j=9;j>=1;j--) { if(n-s[j]>=0&&((n-s[j])/min>=i))//判断消耗之后剩余的可否染当前的数字; { cout<<j; n-=s[j]; break; } } } cout<<endl; } }
点击打开链接
-
There are multiple test cases.