Puž
브론즈 I의견: 0
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 |
2 1 545 1 62100 99 1000000000999999901평가 및 의견
Puž
아직 의견이 없습니다. 자격이 된다면 위 양식에서 가장 먼저 평가해 보세요.
풀이 제출
Puž