{"raw_statement":[{"iden":"statement","content":"Over the quarantine season, you decide to watch your weight by limiting yourself to a certain amount of calories a day. In your house, you stocked up on a small variety of foods before the quarantine, and regardless of what time of the day it is, you must choose from these items:\n\nSteak: 500 Cal\n\nApple: 100 Cal\n\nBread: 50 Cal\n\nYou will be given a number $n$, denoting the number of calories you have limited yourself to for the day.\n\n$n$ will be divisible by 50.\n\nPrint the minimum amount of articles of food you must consume for the day in order to reach your caloric limit exactly.\n\n"},{"iden":"input","content":"You will be given a number $n$, denoting the number of calories you have limited yourself to for the day.$n$ will be divisible by 50."},{"iden":"output","content":"Print the minimum amount of articles of food you must consume for the day in order to reach your caloric limit exactly."},{"iden":"examples","content":"Input2350\nOutputSteak: 4\nApples: 3\nBread: 1\nInput2500\nOutputSteak: 5\nApples: 0\nBread: 0\n"}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ n \\in \\mathbb{Z}^+ $ be the daily caloric limit, with $ 50 \\mid n $.  \nLet the food items be defined by their caloric values:  \n- Steak: $ c_1 = 500 $  \n- Apple: $ c_2 = 100 $  \n- Bread: $ c_3 = 50 $  \n\n**Objective**  \nFind the minimum number of food items $ m \\in \\mathbb{Z}^+ $ such that:  \n$$\n500x + 100y + 50z = n, \\quad x, y, z \\in \\mathbb{Z}_{\\geq 0}\n$$\nand $ m = x + y + z $ is minimized.","simple_statement":"You can eat steak (500 cal), apple (100 cal), or bread (50 cal).  \nGiven a target calorie amount n (divisible by 50), find the minimum number of food items needed to reach exactly n calories.","has_page_source":false}