Mad scientist Mike is building a time machine in his spare time. To finish the work, he needs a resistor with a certain resistance value.
However, all Mike has is lots of identical resistors with unit resistance R0 = 1. Elements with other resistance can be constructed from these resistors. In this problem, we will consider the following as elements:
- one resistor;
- an element and one resistor plugged in sequence;
- an element and one resistor plugged in parallel.
![](http://codeforces.com/predownloaded/da/e5/dae53ab4d8dc6e400a2df8ebfc649ea1a2c9799f.png)
With the consecutive connection the resistance of the new element equals R = Re + R0. With the parallel connection the resistance of the new element equals . In this case Re equals the resistance of the element being connected.
Mike needs to assemble an element with a resistance equal to the fraction . Determine the smallest possible number of resistors he needs to make such an element.
The single input line contains two space-separated integers a and b (1 ≤ a, b ≤ 1018). It is guaranteed that the fraction is irreducible. It is guaranteed that a solution always exists.
Print a single number — the answer to the problem.
Please do not use the %lld specifier to read or write 64-bit integers in С++. It is recommended to use the cin, cout streams or the%I64d specifier.
1 1
1
3 2
3
199 200
200
In the first sample, one resistor is enough.
In the second sample one can connect the resistors in parallel, take the resulting element and connect it to a third resistor consecutively. Then, we get an element with resistance . We cannot make this element using two resistors.
题目链接:http://codeforces.com/contest/343/problem/A
从退了队就没有写过一篇博客,两个月没有写。。。感谢QAQ大大
这个题的意思是给你一些电阻为1的小电阻,让你通过串联和并联的方式来组成一个阻值为a/b的大电阻,现在我们考虑第三组数据,199/200,我们考虑并联,1/(1/199+1)不就是199/200,所以我们用199个电阻串联,然后并上一个1欧的电阻,大电阻的值就为199/200,所以我们逆向贪心回去即可,详见代码。
代码:
#include <cstdio>
#include <cstring>
#include <iostream>
#define LL long long
using namespace std;
int main(){
LL a,b;
scanf("%I64d%I64d",&a,&b);
LL sum=0;
while(1){
if(a<b){
swap(a,b);
}
LL k=a/b;
a-=k*b;
sum+=k;
if(a%b==0)
break;
}
printf("%I64d\n",sum);
return 0;
}