M - Buy Sticks (贪心)

Imyourgod need 3 kinds of sticks which have different sizes: 20cm, 28cm and 32cm. However the shop only sell 75-centimeter-long sticks. So he have to cut off the long stick. How many sticks he must buy at least.
Input
The first line of input contains a number t, which means there are t cases of the test data.
There will be several test cases in the problem, each in one line. Each test cases are described by 3 non-negtive-integers separated by one space representing the number of sticks of 20cm, 28cm and 32cm. All numbers are less than 10^6.
Output
The output contains one line for each line in the input case. This line contains the minimal number of 75-centimeter-long sticks he must buy. Format are shown as Sample Output.

Sample Input
2
3 1 1
4 2 2

Sample Output
Case 1: 2
Case 2: 3

题目大意：
要把长度为75的木棒切成特定数量规格为20、28或32的木棒，问至少需要多少条长度为75的木棍

解题思路：
一根75的木棍可以按以下切分

20	28	32
3	0	0
2	1	0
2	0	1
0	1	1
0	0	2
0	2	0

可以看出28和32的作用是一样的，完全可以把32的当做28的来看，然后再看下表思路就清晰多了

20	28
2	1
3	0
0	2

分析一下，当20和28的棍子都需要时，取2，1组合是最优的，直到一方被满足

完整代码：

#include<iostream>
using namespace std;
int main()
{
	int t;
	cin>>t;
	for(int i=0;i<t;i++){
		int a,b,c,sum=0;
		cin>>a>>b>>c;
		b+=c;		//将32的当28的对待 
		int d=(a+1)/2;		//求出2，1组合数 
		if(d>b){ 			//组合过多就回溯 
			a-=b*2;
			sum+=b+(a/3)+(a%3!=0);
		}else{			//正常组合数 
			b-=d;
			sum+=d+b/2+b%2;
		}
		cout<<"Case "<<i+1<<": "<<sum<<endl;
	}
}