UVA-11388 GCD LCM
来源:互联网 发布:数据库相关期刊 编辑:程序博客网 时间:2024/05/21 09:09
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 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
2
1 2
3 4
Sample Output
1 2
-1
分析:GCD和LCM。本题利用了GCD和LCM的关系:lcm(a,b)=a/gcd(a,b)*b
用辗转相除法求GCD:
int gcd(int a,int b){ if(b==0) return a; else return gcd(b,a%b);}
Source:
#include<stdio.h>int main(){ int gcd,lcm,t; scanf("%d",&t); while(t--) { scanf("%d%d",&gcd,&lcm); if(lcm%gcd==0) printf("%d %d\n",gcd,lcm); else printf("-1\n"); } return 0;}
- UVa 11388 - GCD LCM
- UVa 11388 - GCD LCM
- uva 11388 - GCD LCM
- UVA 11388 - GCD LCM
- UVa:11388 GCD LCM
- UVA - 11388 GCD LCM
- UVa 11388 - GCD LCM
- UVA 11388 GCD LCM
- UVa 11388----GCD LCM
- UVA 11388 GCD LCM
- uva 11388 GCD LCM
- UVA 11388 GCD LCM
- UVA - 11388 GCD LCM
- UVa-11388 GCD LCM
- UVA-11388 GCD LCM
- UVA 11388 GCD LCM (数论)
- UVA 11388 - GCD LCM 水~
- UVA 11388 - GCD LCM(数论)
- ReactNative 在Xcode 中注意事项。(重点)
- 打印直角三角形
- jvm类加载机制
- 第一篇博客
- LintCode_2_尾部的零
- UVA-11388 GCD LCM
- 一天浓缩学习webpack经过
- Junit学习资料(转2)
- ORACLE多表关联UPDATE 语句
- Mysql基准测试
- 全局变量 局部变量
- Linux:使用ftp工具(winscp)
- 第二行代码第八章笔记
- 打开了尘封多年的博客