Anne works as a cake decorator for a prestigious confectionary. She uses four different types of decorations for each of her cakes that she has to buy every week. Given that she is only allowed a fixed budget for this weekly purchase, she has to buy the decorations without exceeding the fixed budget limit L.
Although Anne’s budget is limited, she still wants to have cakes with all four different types of decorations, type A, B, C, and, D. How many cakes with “different” decorations can be created by Anne, given the budget limit L for the week, i.e. how many cakes can Anne create until she is forced to create a cake, which has the exact same decorations with another cake she had already created before?
Consider that your input will include the budget limit L and the prices of all decorations of type A, all decorations of Type B, all decorations of Type C and all decorations of type D. Your output should be the number of cakes with different decorations that can be created provided that two cakes are different if they differ in at least one ornament of the four used ornaments.
Input Specification
Each test case starts with a line containing five integers L, A, B, C, D, (1 ≤ L ≤ 108, 1 ≤ A, B, C, D ≤ 5 000), separated by a space, representing (in this order):
- the budget upper limit,
- the number of available Type A decorations,
- the number of available Type B decorations,
- the number of available Type C decorations, and,
- the number of available Type D decorations
Each of the next four lines contains a list of prices. The first line contains the price list for the Type A decoration, the second line contains the price list for the Type B decoration, the third line contains the price list for the Type C decoration, and the fourth line contains the price list for the Type D decoration. All items in all lists are positive integers not exceeding 100. There is one empty line after each test case . The input is terminated by a line with five zeros.
The program will be tested using a file input with all the test cases.
Output Specification
For each test case print on a separate line the number of different cakes which can be created from the four decoration types and have price not exceeding L.
Shawn has been a well-known chef for years and is now preparing a book of dessert recipes. He is very happy with his work but as he completed the typing of the first few recipes, he realized that he forgot to specify the type of flour that the readers of his book should use.
To help Ernest out, create a program that asks Ernest for the filename of the recipe and the type of flour, then reads in the recipe, i.e. one recipe in one page (1 - 45 lines of text), and adds the type of flour in front of the word “flour” throughout the recipe.
Create a new file that contains the corrected recipe and output, in standard output, the number of occurrences of the word “flour” in the original recipe.
Input Specification
The recipe file exists in the same folder as the main program file.
The submitted program should request from the user interactively the name of the file and the type of flour for the specific recipe.
Note: The recipe files will only contain lowercase letters.
Output Specification
For each test case create a new file in the same folder as the recipe text file, name it newfile.txt and write the modified recipe in this file.
In standard output, output the number of occurrences of the word “flour” in the recipe file.
You will be given a total number N of marbles, which are to be deposited into three separate containers. There is a lower limit L on the number of marbles that must be kept in each container.
Find out in how many ways might these N marbles be placed into the containers in such a way that the number of marbles in each container does not contain digit ‘3’ in its numerical representation.
In this problem, do not distinguish between individual marbles as they are all more or less of the same size and material. Only distinguish between the containers.
No marble can be divided into pieces.
Input Specification
The test cases are given as a text file and are separated by an empty line.
Each test case consists of a single line containing two integers N, L (1 ≤ N ≤ 1010 000, 1 ≤ L ≤ N/3) separated by space and representing the total number of marbles and the lower limit on the number of marbles which have to be placed in each of the containersstrong>.
Note: The input is terminated by a line with two zeros.
Output Specification
For each test case print on a separate line the number of possible divisions of the marbles into the three given pools.
Place Winning Team: Mip-Map (University of Cyprus)
Place Winning Team: Washing Machines (University of Cyprus)