[백준] 19532

탐색 범위를 줄일 수 있을까?
1) 전체 탐색 하기 -> x -999~999까지 돌 때 y도 점검하기
2) 이중 반복문 빠져나오는 법 1.label 2.boolean 3. return

import java.util.*;
import java.io.*;

public class Main {

    public static void main(String[] args) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));

        StringTokenizer st = new StringTokenizer(br.readLine());

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

        int x = 0;
        int y = 0;

        loop:
        for(int i=-999; i<=999; i++) {
            for(int j=-999; j<=999; j++) {
                if((a*i+b*j) == c && (d*i+e*j) == f) {
                    x = i;
                    y = j;
                    break loop;
                }
            }
        }

        bw.write(x+" "+y);
        bw.flush();
        bw.close();
        br.close();
    }
}