zoukankan      html  css  js  c++  java
  • UVa11388

    11388 GCD LCM
    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
    21
    2
    3 4
    Sample Output
    1 2
    -1

    题意:

           输入两整数G、L,找出两正整数a、b使得它们的最大公约数是G最小公倍数是L。

     1 #include <cstdio>
     2 int main(){
     3     int T; scanf("%d",&T);
     4     while(T--){
     5         int G,L; scanf("%d%d",&G,&L);
     6         if(L % G) printf("-1
    ");
     7         else printf("%d %d
    ",G,L);
     8     }
     9     return 0;
    10 }
    View Code
  • 相关阅读:
    flask上下管理文相关
    flask上下管理文相关
    flask上下文管理相关-LocalStack 对象维护栈
    flask上下文管理相关
    flask-wtforms组件
    flask数据库连接池DBUtils
    flask蓝图blueprint是什么
    flask不得不知的基础
    产品的四个主要的要素
    C# 函数式编程:LINQ
  • 原文地址:https://www.cnblogs.com/cyb123456/p/5836625.html
Copyright © 2011-2022 走看看