{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003e\nConsider a currency system in which there are notes of six denominations, namely, Tk. 1, Tk. 2, Tk. 5, Tk. 10, Tk. 50, Tk. 100.\u003cbr /\u003e If the sum of Tk. \u003cb\u003eN\u003c/b\u003e is input, write a program to compute the smallest number of notes that will combine to give Tk. \u003cb\u003eN\u003c/b\u003e.\n\u003c/p\u003e\n\n\n\u003ch3\u003eInput\u003c/h3\u003e\n\u003cp\u003e \n\nThe first line contains an integer \u003cb\u003eT\u003c/b\u003e, the total number of test cases. Then follow \u003cb\u003eT\u003c/b\u003e lines, each line contains an integer \u003cb\u003eN\u003c/b\u003e. \n\u003c/p\u003e\n\n\u003ch3\u003eOutput\u003c/h3\u003e\n\u003cp\u003eFor each test case, display the smallest number of notes that will combine to give \u003cb\u003eN\u003c/b\u003e, in a new line.\u003c/p\u003e\n\n\u003ch3\u003eConstraints\u003c/h3\u003e\n\u003cul\u003e\u003cli\u003e1 \u003cb\u003e≤\u003c/b\u003e \u003cb\u003eT\u003c/b\u003e \u003cb\u003e≤\u003c/b\u003e 1000\u003c/li\u003e\n\u003cli\u003e1 \u003cb\u003e≤\u003c/b\u003e \u003cb\u003eN\u003c/b\u003e \u003cb\u003e≤\u003c/b\u003e 1000000\u003c/li\u003e\n\u003c/ul\u003e"}},{"title":"Sample 1","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e3 \n1200\n500\n242\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e12\n5\n7\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}