[class2] (백준 2869) 달팽이는 올라가고 싶다.

문제

땅 위에 달팽이가 있다. 이 달팽이는 높이가 V미터인 나무 막대를 올라갈 것이다.

달팽이는 낮에 A미터 올라갈 수 있다. 하지만, 밤에 잠을 자는 동안 B미터 미끄러진다. 또, 정상에 올라간 후에는 미끄러지지 않는다.

달팽이가 나무 막대를 모두 올라가려면, 며칠이 걸리는지 구하는 프로그램을 작성하시오.

입력

첫째 줄에 세 정수 A, B, V가 공백으로 구분되어서 주어진다. (1 ≤ B < A ≤ V ≤ 1,000,000,000)

출력

첫째 줄에 달팽이가 나무 막대를 모두 올라가는데 며칠이 걸리는지 출력한다.

제한

 

예제 입력 1

2 1 5

예제 출력 1

4

예제 입력 2

5 1 6

예제 출력 2

2

예제 입력 3

100 99 1000000000

예제 출력 3

999999901

힌트

 

W3sicHJvYmxlbV9pZCI6IjI4NjkiLCJwcm9ibGVtX2xhbmciOiIwIiwidGl0bGUiOiJcdWIyZWNcdWQzM2RcdWM3NzRcdWIyOTQgXHVjNjJjXHViNzdjXHVhYzAwXHVhY2UwIFx1YzJmNlx1YjJlNCIsImRlc2NyaXB0aW9uIjoiPHA+XHViNTQ1IFx1YzcwNFx1YzVkMCBcdWIyZWNcdWQzM2RcdWM3NzRcdWFjMDAgXHVjNzg4XHViMmU0LiBcdWM3NzQgXHViMmVjXHVkMzNkXHVjNzc0XHViMjk0IFx1YjE5Mlx1Yzc3NFx1YWMwMCBWXHViYmY4XHVkMTMwXHVjNzc4IFx1YjA5OFx1YmIzNCBcdWI5YzlcdWIzMDBcdWI5N2MgXHVjNjJjXHViNzdjXHVhYzA4IFx1YWM4M1x1Yzc3NFx1YjJlNC48XC9wPlxyXG5cclxuPHA+XHViMmVjXHVkMzNkXHVjNzc0XHViMjk0IFx1YjBhZVx1YzVkMCBBXHViYmY4XHVkMTMwIFx1YzYyY1x1Yjc3Y1x1YWMwOCBcdWMyMTggXHVjNzg4XHViMmU0LiBcdWQ1NThcdWM5YzBcdWI5Y2MsIFx1YmMyNFx1YzVkMCBcdWM3YTBcdWM3NDQgXHVjNzkwXHViMjk0IFx1YjNkOVx1YzU0OCBCXHViYmY4XHVkMTMwIFx1YmJmOFx1YjA0NFx1YjdlY1x1YzljNFx1YjJlNC4gXHViNjEwLCBcdWM4MTVcdWMwYzFcdWM1ZDAgXHVjNjJjXHViNzdjXHVhYzA0IFx1ZDZjNFx1YzVkMFx1YjI5NCBcdWJiZjhcdWIwNDRcdWI3ZWNcdWM5YzBcdWM5YzAgXHVjNTRhXHViMjk0XHViMmU0LjxcL3A+XHJcblxyXG48cD5cdWIyZWNcdWQzM2RcdWM3NzRcdWFjMDAgXHViMDk4XHViYjM0IFx1YjljOVx1YjMwMFx1Yjk3YyBcdWJhYThcdWI0NTAgXHVjNjJjXHViNzdjXHVhYzAwXHViODI0XHViYTc0LCBcdWJhNzBcdWNlNjBcdWM3NzQgXHVhYzc4XHViOWFjXHViMjk0XHVjOWMwIFx1YWQ2Y1x1ZDU1OFx1YjI5NCBcdWQ1MDRcdWI4NWNcdWFkZjhcdWI3YThcdWM3NDQgXHVjNzkxXHVjMTMxXHVkNTU4XHVjMmRjXHVjNjI0LjxcL3A+XHJcbiIsImlucHV0IjoiPHA+XHVjY2FiXHVjOWY4IFx1YzkwNFx1YzVkMCBcdWMxMzggXHVjODE1XHVjMjE4IEEsIEIsIFZcdWFjMDAgXHVhY2Y1XHViYzMxXHVjNzNjXHViODVjIFx1YWQ2Y1x1YmQ4NFx1YjQxOFx1YzViNFx1YzExYyBcdWM4ZmNcdWM1YjRcdWM5YzRcdWIyZTQuICgxICZsZTsgQiAmbHQ7IEEgJmxlOyBWICZsZTsgMSwwMDAsMDAwLDAwMCk8XC9wPlxyXG4iLCJvdXRwdXQiOiI8cD5cdWNjYWJcdWM5ZjggXHVjOTA0XHVjNWQwIFx1YjJlY1x1ZDMzZFx1Yzc3NFx1YWMwMCBcdWIwOThcdWJiMzQgXHViOWM5XHViMzAwXHViOTdjIFx1YmFhOFx1YjQ1MCBcdWM2MmNcdWI3N2NcdWFjMDBcdWIyOTRcdWIzNzAgXHViYTcwXHVjZTYwXHVjNzc0IFx1YWM3OFx1YjlhY1x1YjI5NFx1YzljMCZuYnNwO1x1Y2Q5Y1x1YjgyNVx1ZDU1Y1x1YjJlNC48XC9wPlxyXG4iLCJoaW50IjoiIiwib3JpZ2luYWwiOiIwIiwiaHRtbF90aXRsZSI6IjAiLCJwcm9ibGVtX2xhbmdfdGNvZGUiOiJLb3JlYW4ifSx7InByb2JsZW1faWQiOiIyODY5IiwicHJvYmxlbV9sYW5nIjoiMSIsInRpdGxlIjoiUFVcdTAxN2QiLCJkZXNjcmlwdGlvbiI6IjxwPlRoZXJlIGlzIGEgc25haWwgb24gdGhlIGdyb3VuZC4gSXQgd2FudHMgdG8gY2xpbWIgdG8gdGhlIHRvcCBvZiBhIHdvb2RlbiBwb2xlIHdpdGggdGhlIGhlaWdodCBvZiBWIG1ldGVycywgbWVhc3VyaW5nIGZyb20gdGhlIGdyb3VuZCBsZXZlbC4gSW4gb25lIGRheSBpdCBjYW4gY2xpbWIgQSBtZXRlcnMgdXB3YXJkcywgaG93ZXZlciBkdXJpbmcgZWFjaCBuaWdodCBpdCBzbGVlcHMsIHNsaWRpbmcgQiBtZXRlcnMgYmFjayBkb3duLiBEZXRlcm1pbmUgdGhlIG51bWJlciBvZiBkYXlzIGl0IG5lZWRzIHRvIGNsaW1iIHRvIHRoZSB0b3AuJm5ic3A7PFwvcD5cclxuIiwiaW5wdXQiOiI8cD5UaGUgZmlyc3QgYW5kIG9ubHkgbGluZSBvZiBpbnB1dCBjb250YWlucyB0aHJlZSBpbnRlZ2VycyBzZXBhcmF0ZWQgYnkgYSBzaW5nbGUgc3BhY2U6IEEsIEIsIGFuZCBWICgxICZsZTsgQiAmbHQ7IEEgJmxlOyBWICZsZTsgMSAwMDAgMDAwIDAwMCksIHdpdGggbWVhbmluZ3MgZGVzY3JpYmVkIGFib3ZlLiZuYnNwOzxcL3A+XHJcbiIsIm91dHB1dCI6IjxwPlRoZSBmaXJzdCBhbmQgb25seSBsaW5lIG9mIG91dHB1dCBtdXN0IGNvbnRhaW4gdGhlIG51bWJlciBvZiBkYXlzIHRoYXQgdGhlIHNuYWlsIG5lZWRzIHRvIHJlYWNoIHRoZSB0b3AuJm5ic3A7PFwvcD5cclxuXHJcbjxwPiZuYnNwOzxcL3A+XHJcbiIsImhpbnQiOiIiLCJvcmlnaW5hbCI6IjEiLCJodG1sX3RpdGxlIjoiMCIsInByb2JsZW1fbGFuZ190Y29kZSI6IkVuZ2xpc2gifV0=

출처

Contest > Croatian Open Competition in Informatics > COCI 2010/2011 > Contest #2 1번

• 문제를 번역한 사람: baekjoon
• 데이터를 추가한 사람: CHULMING, jm0707
• 문제의 오타를 찾은 사람: hellogaon
• 빠진 조건을 찾은 사람: jh05013

 

#include <iostream>
using namespace std;

int main()
{
	int up, down, len, beforeDay;
	cin >> up >> down >> len;
	beforeDay = (len - up) % (up - down) == 0 ? (len - up) / (up - down) : (len - up) / (up - down) + 1;
	cout << beforeDay + 1 << endl;
	return 0;
}