ACM International Collegiate Programming Contest, Asia Regional (Tokyo), 2004, Problem A

gistfile1.java

import java.io.File;
import java.io.FileNotFoundException;
import java.util.Scanner;

public class Asia2004A {

    public static void main(String[] args) throws FileNotFoundException {
        int a, b, d;
        Scanner s = new Scanner(new File(args[0]));
        while (true) {
            a = s.nextInt();
            b = s.nextInt();
            d = s.nextInt();
            if (a == 0 && b == 0 && d == 0) {
                break;
            }
            // processing
            int x = 0, y = 0, num = 0;
            int maxsum = 0;
            boolean found = false;

            while (!found) {
                num++;
                maxsum = 0;
                for (int i = 0; i <= num; i++) {
                    if (a * i - b * (num - i) == d ||
                            b * (num - i) - a * i == d ||
                            a * i + b * (num - i) == d) {
                        found = true;
                        if (maxsum == 0 ||
                                a * i + b + (num - i) < maxsum) {
                            x = i;
                            y = num - i;
                            maxsum = a * i + b * (num - i);
                        }
                    }
                }
            }
            System.out.println(x + " " + y);
        }
    }
}