# Educational Codeforces Round 26 E. Vasya's Function(数论)

E. Vasya's Function
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Vasya is studying number theory. He has denoted a function f(a, b) such that:

• f(a, 0) = 0;
• f(a, b) = 1 + f(a, b - gcd(a, b)), where gcd(a, b) is the greatest common divisor of a and b.

Vasya has two numbers x and y, and he wants to calculate f(x, y). He tried to do it by himself, but found out that calculating this function the way he wants to do that might take very long time. So he decided to ask you to implement a program that will calculate this function swiftly.

Input

The first line contains two integer numbers x and y (1 ≤ x, y ≤ 1012).

Output

Print f(x, y).

Examples
input
3 5

output
3

input
6 3

output
1


#include<iostream>
#include<algorithm>
#include<cmath>
#define ll long long

using namespace std;

ll gcd(ll x,ll y)
{
if(x==0)
return y;

return gcd(y%x,x);
}

ll find(ll x,ll y)
{
if(y==0)
return 0;

ll temp=gcd(x,y);
x/=temp;y/=temp;
ll tempa=x,tempb=y;

for(ll i=2;i*i<=x;i++)
{
if(x%i)
continue;

tempb=min(tempb,y%i);
while(x%i==0)
x/=i;
}

if(x!=1)
tempb=min(tempb,y%x);

return find(tempa,y-tempb)+tempb;
}

int main()
{
ll a,b;
while(cin>>a>>b)
{
ll sum=find(a,b);
cout<<sum<<endl;
}
return 0;
}

• 评论

• 上一篇
• 下一篇