#B. 苹果和虫子

    Type: Default 1000ms 128MiB

苹果和虫子

You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.

说明

你买了一箱nn个苹果,很不幸的是买完时箱子里混进了一条虫子。虫子每xx小时能吃掉一个苹果,假设虫子在吃完一个苹果之前不会吃另一个,那么经过yy小时你还有多少个完整的苹果?

输入格式

输入仅一行包括三个不超过10310^3的非负整数n,xn,xyy,数据保证yn×xy\leq n\times x。

输出格式

输出也仅一行,剩下的苹果个数。要求为完整的苹果数。

样例

10 4 9
7

XCPC 24寒假冬令营 练习2

Not Attended
Status
Done
Rule
ACM/ICPC
Problem
6
Start at
2024-2-3 21:30
End at
2024-2-13 21:30
Duration
240 hour(s)
Host
Partic.
7