Codeforces Beta Round #16 (Div. 2 Only)——C

最新推荐文章于 2024-09-25 11:53:33 发布

tagyona

最新推荐文章于 2024-09-25 11:53:33 发布

阅读量735

点赞数

CC 4.0 BY-SA版权

分类专栏： Codeforces

本文链接：https://blog.youkuaiyun.com/z690933166/article/details/8552541

Codeforces 专栏收录该内容

66 篇文章

订阅专栏

本文介绍了一种方法来调整C.Monitor AB999显示器的尺寸，使其屏幕比例从原始大小变为指定的比例x:y，同时确保调整后的屏幕面积达到最大。包括输入参数解析、最大公约数的计算、最小倍数的查找等关键步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Reca company makes monitors, the most popular of their models is AB999 with the screen size a × b centimeters. Because of some production peculiarities a screen parameters are integer numbers. Recently the screen sides ratio x: y became popular with users. That's why the company wants to reduce monitor AB999 size so that its screen sides ratio becomes x: y, at the same time they want its total area to be maximal of all possible variants. Your task is to find the screen parameters of the reduced size model, or find out that such a reduction can't be performed.

Input

The first line of the input contains 4 integers — a, b, x and y (1 ≤ a, b, x, y ≤ 2·10⁹).

Output

If the answer exists, output 2 positive integers — screen parameters of the reduced size model. Output 0 0 otherwise.

       Sample test(s)
     
         input
       
800 600 4 3

         output
       
800 600

         input
       
1920 1200 16 9

         output
       
1920 1080

         input
       
1 1 1 2

         output
       
0 0

#include <cstdio>
#include <algorithm>
#include <iostream>
#include <cmath>
using namespace std;

int gcd(int x,int y)
{
    int r=x%y;
    while(r)
    {
        x=y;
        y=r;
        r=x%y;
    }
    return y;
}
int main()
{
     int a,b,x,y;
     scanf("%d%d%d%d",&a,&b,&x,&y);
     int g=gcd(x,y);//求x,y的最大公约数约分
     x/=g;
     y/=g;
     int m=min(a/x,b/y);//找到最小倍数
     printf("%d %d\n",m*x,m*y);
     return 0;
}