Pagini recente » Cod sursa (job #3239295) | Cod sursa (job #2377848) | Cod sursa (job #1588939) | Cod sursa (job #1454138)
#include <stdio.h>
#include <iostream>
#include <cstring>
#include <stdlib.h>
#include <time.h>
#include <bitset>
#include <string>
#include <vector>
#include <math.h>
#include <stack>
#include <queue>
#include <list>
#include <set>
#include <map>
#include <limits.h>
#include <algorithm>
#include <deque>
using namespace std;
int n,a,b,c,i,x,y,z,d;
inline int gcd(int a,int b)
{
if (b==0) { x=1; y=0; return (a); } else
{
int l=gcd(b,a%b);
z=x; x=y;
y=z-(a/b)*y;
return l;
}
}
int main(){
freopen("euclid3.in","r",stdin);
freopen("euclid3.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++){
scanf("%d%d%d",&a,&b,&c); d=gcd(a,b);
if (c%d!=0) printf("0 0\n"); else
printf("%d %d\n",(c/d)*x,(c/d)*y);
}
return 0;
}