Cod sursa(job #1447983)

Utilizator DuxarFII-Stefan-Negrus Duxar Data 5 iunie 2015 21:25:12
Problema Algoritmul lui Euclid extins Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 2.82 kb
#ifdef ONLINE_JUDGE
#include <bits/stdc++.h>
#else
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iostream>
#include <map>
#include <set>
#include <stack>
#include <string>
#include <utility>
#include <vector>
#include <queue>
#endif

using namespace std;

	// lambda : [] (int a, int b) -> bool { body return }
	// string r_str = R"(raw string)"

#define mp make_pair
#define mt make_tuple
#define eb emplace_back
#define pb push_back
#define LL long long
#define ULL unsigned long long
#define BASE 73
#define NMAX 10000
#define NMAX2 20001
#define MOD1 1000000007
#define ALL(V) (V).begin(), (V).end()
#define ALLR(V) (V).rbegin(), (V).rend()
#define CRLINE Duxar(__LINE__);
#define SHOWME(x) cerr << __LINE__ << ": " << #x << " = " << (x) << endl;
#define ENTER putchar('\n');

int dx4[] = {-1, 0, 1, 0};
int dy4[] = {0, 1, 0, -1};

int dx8[] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};

void Duxar(int _this_line) {
#ifndef ONLINE_JUDGE
	printf("\n . . . . . . . . . . . . . Passed line - %d\n", _this_line);
#endif
}

template <class T>
void ReadNo(T &_value) {
	T _sign = 1;
	char ch;
	_value = 0;
	while(!isdigit(ch = getchar())) {
		(ch == '-') && (_sign = -1);
	}
	do {
		_value = _value * 10 + (ch - '0');
	} while(isdigit(ch = getchar()));
	_value *= _sign;
}

template <class T>
void AddNr(T &a, T b) {
	a = a + b;
	while (a >= MOD1) {
		a -= MOD1;
	}
	while (a < 0) {
		a += MOD1;
	}
}

tuple <int, int, int> extended_gcd(int a, int b) {
	pair <int, int> C1, C2, C3;
	int quo, rem;
	C1 = make_pair(1, 0);
	C2 = make_pair(0, 1);
	while (b != 0) {
		quo = a / b;
		rem = a % b;
		if (rem == 0) {
			break;
		}
		C3.first = C1.first - quo * C2.first;
		C3.second = C1.second - quo * C2.second;
		a = b;
		b = rem;
		C1 = C2;
		C2 = C3;
	}
	return make_tuple(C3.first, C3.second, b);
}

void solve() {
	int a, b, c, x, y, g;
	cin >> a >> b >> c;
	if (a == 0 && b == 0) {
		printf("0 0\n");
		return ;
	}
	if (a == 0) {
		if (c % b == 0) {
			printf("0 %d\n", c / b);
		}
		else {
			printf("0 0\n");
		}
		return ;
	}
	if (b == 0) {
		if (c % a == 0) {
			printf("%d 0\n", c / a);
		}
		else {
			printf("0 0\n");
		}
		return;
	}
	if (c % a == 0) {
		printf("%d 0\n", c / a);
		return;
	}
	if (c % b == 0) {
		printf("0 %d\n", c / b);
		return;
	}
	tie(x, y, g) = extended_gcd(a, b);
	if (c % g == 0) {
		int aux = c / g;
		printf("%d %d\n", x * aux, y * aux);
	}
	else {
		printf("0 0\n");
	}
}

int main(){
	string fileInput = "euclid3";
#ifdef INFOARENA
	freopen((fileInput + ".in").c_str(), "r", stdin);
	freopen((fileInput + ".out").c_str(), "w", stdout);
#else
#ifndef ONLINE_JUDGE
	freopen("/Users/duxar/Workplace/Xcode Projects/Selectie/Selectie/input", "r", stdin);
#endif
#endif
	
	int t;
	cin >> t;
	while (t--) {
		solve();
	}
	
	return 0;
}