acm 1010颜料问题
来源:互联网 发布:淘宝官方网址 编辑:程序博客网 时间:2024/04/26 08:01
1.1010
2.Problem Description
The local toy store sells small fingerpainting kits with between three and twelve 50ml bottles of paint, each a different color. The paints are bright and fun to work with, and have the useful property that if you mix X ml each of any three different colors, you get X ml of gray. (The paints are thick and "airy", almost like cake frosting, and when you mix them together the volume doesn't increase, the paint just gets more dense.) None of the individual colors are gray; the only way to get gray is by mixing exactly three distinct colors, but it doesn't matter which three. Your friend Emily is an elementary school teacher and every Friday she does a fingerpainting project with her class. Given the number of different colors needed, the amount of each color, and the amount of gray, your job is to calculate the number of kits needed for her class.
Input
The input consists of one or more test cases, followed by a line containing only zero that signals the end of the input. Each test case consists of a single line of five or more integers, which are separated by a space. The first integer N is the number of different colors (3 <= N <= 12). Following that are N different nonnegative integers, each at most 1,000, that specify the amount of each color needed. Last is a nonnegative integer G <= 1,000 that specifies the amount of gray needed. All quantities are in ml. <br>
Output
For each test case, output the smallest number of fingerpainting kits sufficient to provide the required amounts of all the colors and gray. Note that all grays are considered equal, so in order to find the minimum number of kits for a test case you may need to make grays using different combinations of three distinct colors.
Sample Input
3 40 95 21 0
7 25 60 400 250 0 60 0 500
4 90 95 75 95 10
4 90 95 75 95 11
5 0 0 0 0 0 333
0
Sample Output
2
8
2
3
4
3.给出颜料需要的数量以及灰色所需的数量,买颜料时每套50ml,特殊的是灰色,只能用3种颜料混合且体积不变,3种aml,混成的灰色还是aml
4.使用贪心算法,先计算最多的那一种,先不考虑灰色,减去所需颜料时用剩下的调配灰色
5.
#include<cstdio>
#include<iostream>
#include<stdio.h>
#include<vector>
#include<algorithm>
#include<numeric>
#include<math.h>
#include<string.h>
#include<map>
#include<set>
#include<iomanip>
using namespacestd;
bool cmp(inta,int b)
{return a>b;}
int main()
{ int n,c,i,s;
int a[100];
while(scanf("%d",&n))
{
if(n==0) break;
for(i=0;i<n;i++)
scanf("%d",&a[i]);
scanf("%d",&c);
sort(a,a+n,cmp);
if(a[0]%50==0) s=a[0]/50;
else s=a[0]/50+1;
for(i=0;i<n;i++)
a[i]=s*50-a[i];
while(c>0)
{ sort(a,a+n,cmp);
if(a[2]==0)
{ s++;
for(i=0;i<n;i++)
a[i]+=50;
}
c--;a[0]--;a[1]--;a[2]--;
}
cout<<s<<endl;
}
return 0;
}
- acm 1010颜料问题
- POJ 2709 混合颜料 acm 贪心
- SDAU 贪心专题 10 颜料问题
- 动态规划----颜料涂墙问题
- 混合颜料(求矩阵的秩问题)
- 最少颜料
- 混合颜料
- 混合颜料
- 混合颜料
- 混合颜料
- 混合颜料问题-网易的笔试题目(高斯消元找极大线性无关组)
- 怎么洗掉衣服上的水粉颜料、丙烯颜料、水彩颜料、油画颜料
- 金色丙烯颜料
- poj 2709 混合颜料
- Vika and Squares(颜料)
- 【JZOJ 4603】颜料大乱斗
- 【JZOJ4603】颜料大乱斗
- 【JZOJ 4603】颜料大乱斗
- JSTL fn函数中字符串拼接
- hdu5652 India and China Origins
- hdu2795 Billboard 线段树单点更新区间最值
- 面向对象设计
- 4使用PhoneGap遇到问题怎么解决?
- acm 1010颜料问题
- BIEE 11g WebService指南
- T-SQL, Part III: Check table's existance
- 【机房个人重构】datagridview的使用
- bzoj 2060(树形DP)
- 一起talk C栗子吧(第一百三十回:C语言实例--C程序内存布局二)
- 蓝桥杯
- FFmpeg实现监控摄像头的RTSP协议转RTMP协议直播
- java自学历程