GCD LCM （简单数学题）

最新推荐文章于 2021-02-25 18:30:10 发布

菇凉小伙

最新推荐文章于 2021-02-25 18:30:10 发布

阅读量764

点赞数

分类专栏：算法文章标签：算法分析

本文链接：https://blog.csdn.net/DreamTrue1101/article/details/83686734

版权

该问题要求根据给定的两个正整数G和L，找到一对正整数(a, b)，使得它们的最大公约数(GCD)为G，最小公倍数(LCM)为L。如果存在这样的数对，则输出a和b，a小于等于b；若不存在，输出'-1'。题目提供了一段C++代码来解决这个问题。" 117401778,10426250,Template.js模板引擎详解与实战,"['前端开发', 'JavaScript库', '模板语法', '数据渲染', 'HTML生成']

摘要由CSDN通过智能技术生成

GCD LCM （题目链接）

UVA - 11388

题目描述：

The GCD of two positive integers is the largest integer that divides both the integers without any remainder. The LCM of two positive integers is the smallest positive integer that is divisible by both the integers. A positive integer can be the GCD of many pairs of numbers. Similarly, it can be the LCM of many pairs of numbers. In this problem, you will be given two positive integers. You have to output a pair of numbers whose GCD is the first number and LCM is the second number.

Input ：

The first line of input will consist of a positive integer T. T denotes the number of cases. Each of the next T lines will contain two positive integer, G and L.

Output：

For each case of input, there will be one line of output. It will contain two positive integers a and b, a ≤ b, which has a

最低0.47元/天解锁文章

菇凉小伙

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
GCD LCM （简单数学题）

GCD LCM （题目链接） UVA - 11388 题目描述：The GCD of two positive integers is the largest integer that divides both the integers without any remainder. The LCM of two positive integers is the smallest po...
复制链接

扫一扫

专栏目录