144周 机会渺茫 java hihocoder
思路
求N,M的约束,如果N的约数也是M的约数,那么sum++;
求N,M约数个n,m
sum/n*m 化简;
化简就用余数互除
tip
1. 可以在求N时判断是否是M的约束,可以简化过程
2. 题目要求是10^12所以必须是用long,int会溢出 (EA)
package hihocoder;
import java.util.*;
/**
* Created by zjl on 17/4/6.
*/
public class hiho_144Weakly {
public static void main(String [] args){
Scanner in = new Scanner(System.in);
long N = in.nextLong();
long M = in.nextLong();
List<Long> list0 = new ArrayList<Long>();
List<Long> list1 = new ArrayList<Long>();
for(int i=1;i<=Math.sqrt(N);i++){
if(N%i==0){
list0.add((long)i);
if (i*i!=N)
list0.add((long)N/i);
}
}
for(int i=1;i<=Math.sqrt(M);i++){
if(M%i==0){
list1.add((long)i);
if (i*i!=M)
list1.add((long)M/i);
}
}
Collections.sort(list0);
Collections.sort(list1);
int sum=0;
for(int i=0;i<list0.size();i++){
long temp = list0.get(i);
if(list1.indexOf(temp)!=-1)
sum++;
}
// System.out.print(sum +' ' +list0.size()*list1.size());
getMin(list0.size()*list1.size(),sum);
}
public static void getMin(int a,int b){
int temp0 =a;
int temp1 = b;
while(a%b!=0){
b=a%b;
a=b;
}
System.out.println(temp0/b+" "+temp1/b);
}
}