Cod sursa(job #2493409)

Utilizator bigmixerVictor Purice bigmixer Data 16 noiembrie 2019 12:04:42
Problema Algoritmul lui Euclid extins Scor 100
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 1.37 kb
#include <bits/stdc++.h>
#define ll long long
#define all(a) (a).begin(), (a).end()
//#pragma GCC optimize("O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define sz() size()
#define fr first
#define sc second
#define pb push_back
#define er erase
#define in insert
#define pi pair<int,int>
#define pii pair<pair<int,int>,int>
#define mp make_pair
#define int long long
#define rc(s) return cout<<s,0
#define rcc(s) cout<<s,exit(0)
///#define cin fin
///#define cout fout
using namespace std;

const int mod=1e9+7;

int t,a,b,c,x,y;

void solve(int x1,int y1){
    if(y1==0){
        x=1;
        y=0;
    }
    else{
        solve(y1,x1%y1);
        int g1=x;
        int g2=y;
        x=g2;
        y=g1-(x1/y1)*g2;
    }
}

int32_t main(){
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
    srand(chrono::steady_clock::now().time_since_epoch().count());
    ifstream fin("euclid3.in");
    ofstream fout("euclid3.out");
    fin >> t;
    while(t--){
        x=0,y=0;
        fin >> a >> b >> c;
        int gc=__gcd(a,b);
        if(c%gc!=0){
            fout << 0 << ' ' << 0 << '\n';
        }
        else{
            solve(a,b);
            x*=(c/gc);
            y*=(c/gc);
            fout << x << ' ' << y << '\n';
        }
    }
}