II U C ONLINE C ON TEST 2 008 | |
Problem D: GCD LCM | |
Input: standard input | |
| |
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 andL.
| |
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 GCD of G and LCM of L. In case there is more than one pair satisfying the condition, output the pair for which a is minimized. In case there is no such pair, output -1.
| |
Constraints | |
- T ≤ 100 - Both G and L will be less than 231.
| |
Sample Input | Output for Sample Input |
2 1 2 3 4 | 1 2 -1 |
题目大意:给出T组测试数据,每组数据有两个数g和l,要求两个数a和b,这两个数的最大公约数是g,最小公倍数是l,如果有多组,就输出a最小的那组;如果不存在这样两个数,就输出-1
一开始想的超级复杂,结果始终做不出来,于是就找了几组数自己算了一下,发现如果这组数存在的话,其实a就是g,b就是l,而存在的条件是l%g是否等于0
#include<iostream>
using namespace std;
int main()
{
int g,l,t;
cin>>t;
while(t--)
{
cin>>g>>l;
if(l%g==0)
cout<<g<<' '<<l<<endl;
else
cout<<-1<<endl;
}
return 0;
}