Skip to content

Instantly share code, notes, and snippets.

@st0le
Created January 15, 2015 01:09
Show Gist options
  • Star 0 You must be signed in to star a gist
  • Fork 0 You must be signed in to fork a gist
  • Save st0le/7df05e55c8f5ab0408fa to your computer and use it in GitHub Desktop.
Save st0le/7df05e55c8f5ab0408fa to your computer and use it in GitHub Desktop.

#New Year's Resolution

###30 points

Alex's New Year's resolution for 2015 is to eat healthier foods. He's done some research and has found out that calories come from three main sources, called macronutrients: protein, carbohydrates, and fat. Alex wants to get the right balance of protein, carbohydrates, and fat to have a balanced diet. For each available food, Alex can only choose to eat it or not eat it. He can't eat a certain food more than once, and he can't eat a fractional amount of a food.

###Input

Input begins with an integer T, the number of test cases. For each test case, the first line consists of three space-separated integers: GP, GC, and GF, which represent the amount of protein, carbohydrates, and fat that Alex wants to eat. The next line has the number of foods for that test case, an integer N. The next N lines each consist of three space-separated integers: P, C, and F, which represent the amount of protein, carbohydrates, and fat in that food, respectively.

###Output

For each test case i, print a line containing "Case #i: " followed by either "yes" if it is possible for Alex to eat the exact amount of each macronutrient, or "no" if it is not possible.

###Constraints

  • 1 ≤ T ≤ 20
  • 1 ≤ N ≤ 20
  • 10 ≤ GP, GC, GF ≤ 1000
  • 10 ≤ P, C, F ≤ 1000
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment