luogu#P8140. [ICPC2020 WF] Trailing Digits
[ICPC2020 WF] Trailing Digits
题目背景
ICPC2020 WF M
题目描述
A large shipment of doodads has just arrived, and each doodad has a suggested retail price of cents. You've noticed that consumers are much more likely to purchase goods when most of the trailing digits are the same. For example, items are more likely to be priced at cents rather than cents. So to make your goods more appealing, you've decided to sell your goods in bundles. To make a bundle, you choose a positive integer , and sell doodads for cents. With an appropriate choice of you can have a more pleasing price. For example, selling -cent doodads in bundles of size means that each bundle sells for cents, which has two trailing s, rather than no trailing s of . This idea of trailing s can be generalized to any other trailing digit: bundles of -cent doodads sell for cents (three trailing s) and bundles of one million doodads sell for cents (six trailing s).
After a little thought, you realize that you do not want to make your bundles too large---not only can the price be excessive, but who really needs several million doodads? For any type of doodad, your marketing department has a maximum bundle price of .
Given the price of a doodad, the desired trailing digit, and the maximum price of a bundle, write a program that optimizes the trailing digits.
输入格式
Input consists of a single line containing three integers , , and , where () is the price of a doodad in cents, () is the desired trailing digit, and () is the maximum price of a bundle.
输出格式
Output the maximum number of consecutive occurrences of that can appear at the end of a bundle price, given that the price of the bundle cannot exceed .
题目大意
题目描述
有一批货,每个价值 元,可以把 个货打包出售,价格是 元(前提是),使末尾含有尽可能多的数字 ,求最多的 数量。
输入格式
一行三个整数, , 和 。
输出格式
一个整数,最多的 数量。
说明/提示
对于全部数据,有 , ,
57 9 1000
2
57 4 40000
3
57 4 39000
2