레이팅 미적용설명
There is a snail on the ground. It wants to climb to the top of a wooden pole with the height of \(V\) meters, measuring from the ground level. In one day it can climb \(A\) meters upwards, however during each night it sleeps, sliding \(B\) meters back down. Determine the number of days it needs to climb to the top.
제약
입력 형식
The first and only line of input contains three integers separated by a single space: \(A\), \(B\), and \(V\) (\(1 \le B < A \le V \le 1\,000\,000\,000\)), with meanings described above.
출력 형식
The first and only line of output must contain the number of days that the snail needs to reach the top.
서브태스크
| 서브태스크 | 점수 | 설명 |
|---|---|---|
Test 1 | 10점 | None |
Test 2 | 10점 | None |
Test 3 | 10점 | None |
Test 4 | 10점 | None |
Test 5 | 10점 | None |
Test 6 | 10점 | None |
Test 7 | 10점 | None |
Test 8 | 10점 | None |
Test 9 | 10점 | None |
Test 10 | 10점 | None |
예제 1
입력
2 1 5출력
4예제 2
입력
5 1 6출력
2예제 3
입력
100 99 1000000000출력
999999901문제 정보
태그