Benefit |
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$](http://uva.onlinejudge.org/external/118/11889img1.png)
![$ \le$](http://uva.onlinejudge.org/external/118/11889img1.png)
![$ \le$](http://uva.onlinejudge.org/external/118/11889img1.png)
Output
Print the lowest integer B such that LCM(A, B) = 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\n");
else printf("%d\n",b);
}
return 0;
}