Exchange for Cola
Problem Description
The Cola company is holding a promotional activity that customerscan exchange B bottles of Cola with A caps. Now Silence has N caps. Furthermore, Silence can ask mm to borrow him some caps for anytimes as long as Silence is able to return the caps borrowed after he has used these caps to exchange Cola without buying any other Cola. Please tell Silence how many number of Cola Silence can drink.
Input
This problem contains multiple test cases. Each case contains oneline with three numbers N , A , B ,(1 <= N <= 10^9, 1 <= B < A <= 10^9), which have already been mentioned above.
Output
Print exactly one line with the maximal number of Cola Silence can drink by exchanging caps for each test case.
Sample Input
1 2 1
9 7 2
Sample Output
1
2
步骤:
1、将手中已有瓶盖全部兑换成可乐
2、将已有可乐全部喝掉(别撑着,喝不了给我),将可乐换成瓶盖
3、返回步骤 1 直到手中瓶盖不够继续兑换
4、找mm借瓶盖,算算是否能还得上。如果还得上,转步骤 5 ,否则转步骤 7
5、将瓶盖借来,将所有瓶盖兑换成可乐,将已有可乐全部喝掉,将可乐换成瓶盖(要是喝不了就把瓶盖拧下来)
6、返回步骤 4
7、告诉我你一共喝了几瓶可乐(剩下的瓶盖自己弹着玩)
要点:
在内存中要注意除法的使用,对于不同数据,b * ( n / a )和b * n / a 的计算结果是不同的
当 n == 45, a == 12, b == 15 时,前者的值为39,后者的值为46,因此造成了无限循环而导致超时
要注意对于因整型数据除法的小数部分省略的习惯造成的表达式的括号的误省略问题
- #include<stdio.h>
- int main()
- {
- long n,a,b;
- long bottle,left;
- while( scanf("%d%d%d",&n,&a,&b) != -1 )
- {
- bottle = 0;
- long i = n;
- while ( i / a != 0 )
- {
- left = i % a;
- bottle += b * ( i / a );//要点中说的就是这里
- i = b * ( i / a ) + left;
- }
- while ( b >= a - i )
- {
- i = b - ( a - i );
- bottle += b;
- }
- printf("%d\n",bottle);
- }
- return 0;
- }