Pagini recente » Cod sursa (job #1950659) | Cod sursa (job #228587) | Cod sursa (job #3268407) | Cod sursa (job #1091865) | Cod sursa (job #3268209)
import java.io.*;
import java.util.StringTokenizer;
public class Main {
static int x,y;
public static int euclid(int a, int b) {
if (b == 0) {
x = 1;
y = 0;
// k[0] = 1;
// k[1] = 0;
return a;
}
int d = euclid(b, a % b);
int t = y;
y = x - (a/b) * y;
x = t;
//
// k[1] = k[0] - (a/b) * k[1];
// k[0] = t;
return d;
}
public static void main(String[] args) throws IOException {
try (BufferedReader reader = new BufferedReader(new FileReader("euclid3.in"));
PrintWriter writer = new PrintWriter(new FileOutputStream("euclid3.out"), true)) {
int T = Integer.parseInt(reader.readLine());
// int[] k = new int[] {0, 0};
for (int i = 0; i < T; i++) {
StringTokenizer st = new StringTokenizer(reader.readLine());
// int a = Integer.parseInt(st.nextToken());
// int b = Integer.parseInt(st.nextToken());
// int c = Integer.parseInt(st.nextToken());
x = 0;
y = 0;
int d = euclid(Integer.parseInt(st.nextToken()), Integer.parseInt(st.nextToken()));
int c = Integer.parseInt(st.nextToken());
if (c % d != 0) {
writer.write("0 0\n");
} else {
int factor = c / d;
writer.write(x * factor + " " + y * factor + "\n");
}
}
}
}
}