CF1041B.Buying a TV Set
入门
通过率:0%
时间限制:1.00s
内存限制:256MB
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
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: hw=yx.
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 (hw=yx).
In other words, Monocarp wants to determine the number of TV sets having aspect ratio yx, 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.
Monocarp 决定购买一台新电视,并将其悬挂在自己公寓的墙上。墙面有足够的空余空间,因此 Monocarp 可以购买屏幕宽度不超过 a、高度不超过 b 的电视。此外,Monocarp 习惯使用具有特定长宽比的电视:形式化地说,若屏幕宽度为 w、高度为 h,则需满足条件 hw=yx。
商店中出售种类繁多的电视。Monocarp 确信:对任意一对正整数 w 和 h,商店中均存在一台屏幕宽度为 w、高度为 h 的电视。
Monocarp 尚未决定具体购买哪一台电视。他首先希望确定最优的屏幕分辨率。他计划尝试所有可能的屏幕尺寸组合,但必须预先计算出满足以下条件的正整数对 (w,h) 的数量:(w≤a)、(h≤b) 且 (hw=yx)。
换言之,Monocarp 想要求出满足长宽比为 yx、屏幕宽度不超过 a、屏幕高度不超过 b 的电视台数。若两台电视的屏幕宽度不同或屏幕高度不同,则视为不同的电视。
输入格式
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.
第一行包含四个整数 a、b、x、y(1≤a,b,x,y≤1018)——分别表示屏幕宽高及长宽比的约束条件。
输出格式
Print one integer — the number of different variants to choose TV screen width and screen height so that they meet the aforementioned constraints.
输出一个整数——满足上述约束条件的不同电视屏幕宽度和高度组合的数量。
输入输出样例
输入#1
17 15 5 3
输出#1
3
输入#2
14 16 7 22
输出#2
0
输入#3
4 2 6 4
输出#3
1
输入#4
1000000000000000000 1000000000000000000 999999866000004473 999999822000007597
输出#4
1000000063
说明/提示
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).
在第一个例子中,有 3 种可能的方案:(5,3)、(10,6)、(15,9)。
在第二个例子中,不存在满足约束条件的电视机。
在第三个例子中,仅有一种方案:(3,2)。
输入解题思路,AI测评打分。不知道怎么写?