Cod sursa(job #775705)

Utilizator geniucosOncescu Costin geniucos Data 8 august 2012 18:27:09
Problema Algoritmul lui Euclid extins Scor 0
Compilator cpp Status done
Runda Arhiva educationala Marime 1.07 kb
#include<cstdio>
using namespace std;
int cm,x1,y1,s1,s2,a,b,c,n,i1;
int cmmdc(int a,int b)
{
    int r;
    while(b!=0)
    {
        r=a%b;
        a=b;
        b=r;
    }
    return a;
}
void rez(int a,int b,int c)
{
    int r,n1,n2,i,nr=0,d1[10005],d2[10005];
    n1=a;
    n2=b;
    while(n2>1)
    {
        nr++;
        r=n1%n2;
        n1=n2;
        n2=r;
    }
    d1[nr]=1;
    d2[nr]=c-n1;
    for(i=nr-1;i>=0;i--)
    {
        d1[i]=d2[i+1];
        d2[i]=d1[i+1]-d1[i];
    }
    for(i=0;i<=1;i++)
    {
        x1=d1[i];
        y1=d2[i];
        if(x1*a*s1+y1*b*s2==c) break;
    }
}
int main()
{
freopen("euclid3.in","r",stdin);
freopen("euclid3.out","w",stdout);
scanf("%d",&n);
for(i1=1;i1<=n;i1++)
{
    scanf("%d",&a);
    scanf("%d",&b);
    scanf("%d",&c);
    s1=1;
    s2=1;
    if(a<0)
    {
        a=a*-1;
        s1=-1;
    }
    if(b<0)
    {
        b=b*-1;
        s2=-1;
    }
    cm=cmmdc(a,b);
    if(c%cm!=0) printf("0 0\n");
    else
    {
        rez(a/cm,b/cm,c/cm);
        x1=x1*s1;
        y1=y1*s2;
        printf("%d %d\n",x1,y1);
    }
}
return 0;
}