zoukankan      html  css  js  c++  java
  • UVA 11889


      Benefit 

    Recently  Yaghoub  is playing a new trick to sell some more. When somebody gives him  A  Tomans, he who never has appropriate changes, asks for  B  Tomans such that lowest common multiple of  A  and  B  equals to  C  and he will pay back a round bill. Or otherwise take some snack instead of the remaining of his money. He believes that finding such a number is hard enough that dissuades students from paying that.

    You should write a program that help poor students giving the appropriate amount of money to Yaghoub. Of course if there are several answers you go for students' benefit which is the lowest of them.

     

    Input 

    The first line begin with an integer  T  (   T$ le$100000 ), the number of tests. Each test that comes in a separate line contains two integers  A  and  C  (   1$ le$AC$ le$107 ).

     

    Output 

    Print the lowest integer  B  such that  LCM(AB) = C  in a single line. If no such integer exists, print " NO SOLUTION " instead. (Quotes for clarity)

     

    Sample Input 

     

    3
    2 6
    32 1760
    7 16
    

     

    Sample Output 

     

    3
    55
    NO SOLUTION
    

     

    题目大意:三个数关系 lcm(a,b)=c,已知a和c,求最小的b,没有输出-1

    解题思路:b为c的约数,枚举b 满足gcd(a,b)*lcm(a,b)==a*b这个条件即可 ,但是注意乘法用 long long

     

    #include <iostream>
    #include <cstdio>
    #include <vector>
    #include <cmath>
    #include <algorithm>
    using namespace std;
    
    int gcd(int a,int b){
    	return (b>0)?gcd(b,a%b):a;
    }
    
    int getb(int a,int c){
    	if(c<a||c%a!=0) return -1;
    	vector <int> v;
    	int max0=int( sqrt(c*1.0)+0.1 );
    	for(int i=1;i<=max0;i++){
    		if(c%i==0){
    			v.push_back(i);
    			v.push_back(c/i);
    		}
    	}
    	sort(v.begin(),v.end());
    	for(int i=0;i<v.size();i++){
    		int b=v[i],g=gcd(a,v[i]);
    		if( (long long)a*(long long)b==(long long)g*(long long)c ) return b;
    	}
    	return -1;
    }
    
    int main(){
    	int t,a,c;
    	scanf("%d",&t);
    	while(t-- >0){
    		scanf("%d%d",&a,&c);
    		int b=getb(a,c);
    		if(b==-1) printf("NO SOLUTION
    ");
    		else printf("%d
    ",b);
    	}
    	return 0;
    }



  • 相关阅读:
    【转载】一键安装maven脚本
    secureCRT的自动登录设置
    vi相关内容
    windows上的命令telnet
    【转载】bash: ifconfig: command not found 解决办法
    【转载】Linux中profile、bashrc、bash_profile之间的区别和联系
    virgo-tomcat没有任务错误日志的停掉的解决办法
    【转载】Linux kill, killall, kill -9
    #!bin/sh是啥
    Mysql 查找表中的多组前n大元素
  • 原文地址:https://www.cnblogs.com/james1207/p/3395425.html
Copyright © 2011-2022 走看看