[SW expert Academy] SWEA 17937번 큰 수의 최대공약수 자바(Java)

[D3] 큰 수의 최대공약수 - 17937

문제 링크

성능 요약

메모리: 21,344 KB, 시간: 136 ms, 코드길이: 920 Bytes

제출 일자

2023-10-20 10:14

출처: SW Expert Academy, https://swexpertacademy.com/main/code/problem/problemList.do

SW Expert Academy

import java.util.*;
import java.io.*;
import java.math.BigInteger;

class Solution
{
	public static void main(String args[]) throws Exception
	{
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();

		for(int tc = 1; tc <= T; tc++)
		{
            BigInteger A = sc.nextBigInteger();
            BigInteger B = sc.nextBigInteger();;
            
            BigInteger gcd = A;
            if(!A.equals(B)){
                gcd = GCD(A,B);
            }
            
            System.out.println("#" + tc + " " + gcd);
		}
    }
    
    private static BigInteger GCD(BigInteger A, BigInteger B){
        BigInteger result = A;
        BigInteger One = new BigInteger("1");
        
        while(A.compareTo(B)  <= 0){

            result = result.gcd(A);
            if(result.equals(One)){
                return One;
            }
            A = A.add(One);
        }
        return result;
    }
    
}

 

쉬운 방법이 있었다.

import java.util.*;
import java.io.*;
import java.math.BigInteger;

class Solution
{
	public static void main(String args[]) throws Exception
	{
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();

		for(int tc = 1; tc <= T; tc++)
		{
            String A = sc.next();
            String B = sc.next();
            
            System.out.println("#" + tc + " " + (A.equals(B)? A : "1"));
		}
    }
}