Competitive-Programming/extended_euclidean_algorithm.cpp at main · armandliv/Competitive-Programming · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
/// https://infoarena.ro/problema/euclid3
#include<cstdio>
#include<fstream>
#include<cmath>
using namespace std;
FILE *f=fopen("euclid3.in","r");
ofstream g("euclid3.out");
int x,y;
int euclid(int a,int b)
{
    if(b==0)
    {
        x=1;
        y=0;
        return a;
    }
    int d;
    d=euclid(b,a%b);
    int xx;
    if(b==d)
    {
        x=1;
        y=a/b-1;
        y-=2*y;
    }
    else
    if(a==d)
    {
        y=0;
        x=a/b-1;
        x-=2*x;
    }
    else
    if(a%b==d)
    {
        x=1;
        y=(a-d)/b;
        if(y>0)
        y-=2*y;
        else
        x=-1;
    }
    else
    {
        xx=x;
        x=y;
        if(y<0)
        y=xx+(a/b)*abs(y);
        else
            y=abs(xx)+(a/b)*y,y-=y*2;
    }
    return d;
}

int main()
{
    int n,a,b,c,i,d;
    fscanf(f,"%d",&n);
    for(i=1;i<=n;i++)
    {
        fscanf(f,"%d%d%d",&a,&b,&c);
        d=euclid(a,b);
        if(c%d!=0)
            g<<"0 0"<<'\n';
        else
        {
            if((a<0&&b>0)||(a>0&&b<0))
            {
                x-=2*x;
                y-=2*y;
                g<<x*(c/d)<<" "<<y*(c/d)<<'\n';
            }
            else
            g<<x*(c/d)<<" "<<y*(c/d)<<'\n';
        }
    }
    return 0;
}