Algorithm/Algorithm 문제

백준_21568 Ax+By=C (확장 유클리드 호제법)

kjyyjk 2024. 2. 10. 23:30

 

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

public class BJ_21568_AxByC {

    public static void main(String[] args) throws IOException {

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine(), " ");
        StringBuilder sb = new StringBuilder();

        int a = Integer.parseInt(st.nextToken());
        int b = Integer.parseInt(st.nextToken());
        int c = Integer.parseInt(st.nextToken());

        int gcd = gcd(a, b);

        if(c%gcd != 0) {
            sb.append(-1);
        } else {
            int[] ret = excute(a, b);
            sb.append(ret[0] * (c/gcd)).append(' ');
            sb.append(ret[1] * (c/gcd)).append(' ');
        }

        System.out.println(sb);
    }

    static int[] excute(int a, int b) {
        if (b==0) {
            return new int[]{1, 0};
        }
        int[] ret = excute(b, a%b);
        int x = ret[1];
        int y = ret[0] - (ret[1]*a/b);

        return new int[]{x, y};
    }

    static int gcd(int a, int b) {
        if (b==0) {
            return a;
        }

        return gcd(b, a%b);
    }

}
 

21568번: Ax+By=C

A, B, C가 주어졌을 때, Ax+By=C를 만족하는 (x, y)중에서 다음을 만족하는 것을 아무거나 찾아보자. x, y는 정수 -1,000,000,000 ≤ x, y ≤ 1,000,000,000

www.acmicpc.net