Cod sursa(job #153147)

Utilizator razvi9Jurca Razvan razvi9 Data 10 martie 2008 10:35:49
Problema Algoritmul lui Euclid extins Scor 70
Compilator cpp Status done
Runda Arhiva educationala Marime 0.94 kb
#include<fstream>
using namespace std;
long long a,b,x,y,d,c,t;
void euclid(long long a,long long b,long long &d,long long &x,long long &y)
{
	if(b==0){
		x=1;
		y=1;
		d=a;
		return;}
	long long x0,y0;
	euclid(b,a%b,d,x0,y0);
	x=y0;
	y=x0-(a/b)*y0;
	if(y<-2000000000) {
		int k=-y-2000000000;
		int a1=a/d,b1=b/d;
		k=k/a1+1;
		x=x-k*b1;
		y=y+k*a1;}
	if(y>2000000000) {
		int k=y-2000000000;
		int a1=a/d,b1=b/d;
		k=k/a1+1;
		x=x+k*b1;
		y=y-k*a1;}
}
int main()
{
	ifstream f("euclid3.in");
	ofstream g("euclid3.out");
	f>>t;
	for(;t;t--){
		f>>a>>b>>c;
		euclid(a,b,d,x,y);
		int k=b/d,l=a/d;
		if(c%d==0){
			x=x*c/d;
			y=y*c/d;
	if(y<-2000000000) {
		int k=-y-2000000000;
		int a1=a/d,b1=b/d;
		k=k/a1+1;
		x=x-k*b1;
		y=y+k*a1;}
	if(y>2000000000) {
		int k=y-2000000000;
		int a1=a/d,b1=b/d;
		k=k/a1+1;
		x=x+k*b1;
		y=y-k*a1;}
			g<<x<<" "<<y<<endl;}
		else
			g<<0<<" "<<0<<endl;}
	g.close();
}