Cod sursa(job #2174281)

Utilizator miruna999Morarasu Miruna miruna999 Data 16 martie 2018 11:27:43
Problema Algoritmul lui Euclid extins Scor 100
Compilator cpp Status done
Runda Arhiva educationala Marime 1.7 kb
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid3.in");
ofstream g("euclid3.out");

inline int gcd( int A, int B, int &X, int &Y )
{
    if (B == 0)
    {
        X = 1;
        Y = 0;
        return A;
    }

    int X0, Y0, D;
    D = gcd( B, A % B, X0, Y0 );

    X = Y0;
    Y = X0 - (A / B) * Y0;
    return D;
}

int main()
{
    int T;
    for (f>>T, assert( T <= 100 ); T; T--)
    {
        int A, B, C;
        f>>A>>B>>C;

        assert( -1000000000 <= A && A <= 1000000000 );
        assert( -1000000000 <= B && B <= 1000000000 );
        assert( -2000000000 <= C && C <= 2000000000 && C != 0 );
        int D, X, Y;
        D = gcd( A, B, X, Y );

        if (C % D)
            g<<"0 0"<<'\n';
        else
            g<< X * (C / D) << " " << Y * (C / D) << '\n';
    }

    return 0;
}
/*
#include <bits/stdc++.h>
using namespace std;
ifstream f("euclid3.in");
ofstream g("euclid3.out");

inline int gcd( int A, int B, int &X, int &Y )
{
    if (B == 0)
    {
        X = 1;
        Y = 0;
        return A;
    }

    int X0, Y0, D;
    D = gcd( B, A % B, X0, Y0 );

    X = Y0;
    Y = X0 - (A / B) * Y0;
    return D;
}

int main()
{
    int T;
    for (f>>T, assert( T <= 100 ); T; T--)
    {
        int A, B, C;
        f>>A>>B>>C;

        assert( -1000000000 <= A && A <= 1000000000 );
        assert( -1000000000 <= B && B <= 1000000000 );
        assert( -2000000000 <= C && C <= 2000000000 && C != 0 );
        int D, X, Y;
        D = gcd( A, B, X, Y );

        if (C % D)
            g<<"0 0"<<'\n';
        else
            g<< X * (C / D) << " " << Y * (C / D) << '\n';
    }

    return 0;
}
*/