301031: CF195A. Let's Watch Football
Memory Limit:256 MB
Time Limit:2 S
Judge Style:Text Compare
Creator:
Submit:0
Solved:0
Description
Let's Watch Football
题意翻译
输入三个整数$a$,$b$,$c$。已知有方程$tb+cb=ac$,求t的值(向上取整)。题目描述
Valeric and Valerko missed the last Euro football game, so they decided to watch the game's key moments on the Net. They want to start watching as soon as possible but the connection speed is too low. If they turn on the video right now, it will "hang up" as the size of data to watch per second will be more than the size of downloaded data per second. The guys want to watch the whole video without any pauses, so they have to wait some integer number of seconds for a part of the video to download. After this number of seconds passes, they can start watching. Waiting for the whole video to download isn't necessary as the video can download after the guys started to watch. Let's suppose that video's length is $ c $ seconds and Valeric and Valerko wait $ t $ seconds before the watching. Then for any moment of time $ t_{0} $ , $ t<=t_{0}<=c+t $ , the following condition must fulfill: the size of data received in $ t_{0} $ seconds is not less than the size of data needed to watch $ t_{0}-t $ seconds of the video. Of course, the guys want to wait as little as possible, so your task is to find the minimum integer number of seconds to wait before turning the video on. The guys must watch the video without pauses.输入输出格式
输入格式
The first line contains three space-separated integers $ a $ , $ b $ and $ c $ $ (1<=a,b,c<=1000,a>b) $ . The first number ( $ a $ ) denotes the size of data needed to watch one second of the video. The second number ( $ b $ ) denotes the size of data Valeric and Valerko can download from the Net per second. The third number ( $ c $ ) denotes the video's length in seconds.
输出格式
Print a single number — the minimum integer number of seconds that Valeric and Valerko must wait to watch football without pauses.
输入输出样例
输入样例 #1
4 1 1
输出样例 #1
3
输入样例 #2
10 3 2
输出样例 #2
5
输入样例 #3
13 12 1
输出样例 #3
1