Gym - 101911J //欧几里得

题目：
Monocarp has decided to buy a new TV set and hang it on the wall in his flat. The wall has enough free space so Monocarp can buy a TV set with screen width not greater than a and screen height not greater than b. Monocarp is also used to TV sets with a certain aspect ratio: formally, if the width of the screen is w, and the height of the screen is h, then the following condition should be met: wh=xy.

There are many different TV sets in the shop. Monocarp is sure that for any pair of positive integers w and h there is a TV set with screen width w and height h in the shop.

Monocarp isn’t ready to choose the exact TV set he is going to buy. Firstly he wants to determine the optimal screen resolution. He has decided to try all possible variants of screen size. But he must count the number of pairs of positive integers w and h, beforehand, such that (w≤a), (h≤b) and (wh=xy).

In other words, Monocarp wants to determine the number of TV sets having aspect ratio xy, screen width not exceeding a, and screen height not exceeding b. Two TV sets are considered different if they have different screen width or different screen height.

Input
The first line contains four integers a, b, x, y (1≤a,b,x,y≤1018) — the constraints on the screen width and height, and on the aspect ratio.

Output
Print one integer — the number of different variants to choose TV screen width and screen height so that they meet the aforementioned constraints.

Examples
Input
17 15 5 3
Output
3
Input
14 16 7 22
Output
0
Input
4 2 6 4
Output
1
Input
1000000000000000000 1000000000000000000 999999866000004473 999999822000007597
Output
1000000063
Note
In the first example, there are 3 possible variants: (5,3), (10,6), (15,9).

In the second example, there is no TV set meeting the constraints.

In the third example, there is only one variant: (3,2).

水题，可以使用辗转相除法(用于计算最大公约数)

简单介绍：
例：49 14

49 除以 14 余 7 49%14=7 14%7=0 ->结果:7
然后再拉出来14(除数变成新的被除数),然后余数变除数
变成14 除以 7 发现余数为0
所以最大公约数是7

辗转相除法就是这样除直到出现余数为0，把除数提出来就是了。

代码：

#include<iostream>
#include<algorithm>
using namespace std;
long long cut(long long x, long long y)
{
	while (x%y != 0)
	{
		long long p2 = x % y;
		x = y;
		y = p2;
	}
	return y;
}
int main()
{
	long long a, b, c, d;
	while (cin >> a >> b >> c >> d)
	{
		long long pq = cut(c, d);
		c /= pq;
		d /= pq;
		long long qu1 = a / c;
		long long qu2 = b / d;
		long long u1 = min(qu1, qu2);
		cout << u1 << endl;
	}
	return 0;
}