Cod sursa(job #1201173)

Utilizator beny10Bia Beniamin beny10 Data 24 iunie 2014 16:14:22
Problema Algoritmul lui Euclid extins Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.43 kb
#include<vector>
#include<string>
#include<string.h>
#include<algorithm>
#include<cstdio>
#include<fstream>
#include<iostream>
#include<ctime>
#include<set>
#include<map>
#include<cmath>

using namespace std;

#define LL long long
#define PII pair<int ,int>
#define PCI pair<char ,int>
#define VB vector <bool>
#define VI vector <int>
#define VC vector <char>
#define WI vector<VI>
#define WC vector<VC>
#define RS resize
#define X first
#define MP make_pair
#define Y second

#define FORN(i,n) for(int i=0;i<n;++i)
#define FOR(i,a,b) for(int i=a;i<=b;++i)
#define FORD(i,a,b) for(int i=a;i>=b;--i)
#define REPEAT do
#define UNTIL(x) while((x))

#define IN_FILE "euclid3.in"
#define OUT_FILE "euclid3.out"
ifstream f(IN_FILE);
ofstream g(OUT_FILE);

//variables
int n;
//other functions
pair<PII, int> euclidExtins(int a,int b)
{
	if (b == 0)
	{
		return make_pair(make_pair(1,0),a);
	}
	else
	{
		pair<PII, int> aux = euclidExtins(b,a%b);
		return make_pair(make_pair(aux.X.Y,aux.X.X-a/b*aux.X.Y),aux.Y);
	}
}
void reading()
{
	int a ,b,c;
	f >> n;
	FORN(i, n)
	{
		f >> a >> b >> c;
		pair<PII, int> aux = euclidExtins(a, b);
		if (c%aux.Y != 0)
		{
			g << "0 0\n";
		}
		else
		{
			g << aux.X.X*(c / aux.Y) << " " << aux.X.Y*(c / aux.Y) << "\n";
		}
	}
	f.close();
}
void solving()
{
	//
}
void write_data()
{
	//
}
int main()
{
	reading();
	solving();
	write_data();
}